Results 301 to 310 of about 842,589 (329)

The generating power of weighted tree automata with initial algebra semantics

arXiv.org
We consider the images of the initial algebra semantics of weighted tree automata over strong bimonoids (hence also over semirings). These images are subsets of the carrier set of the underlying strong bimonoid. We consider locally finite, weakly locally
Manfred Droste, Zoltán Fülöp, A. Tepavčević, H. Vogler   +3 more
semanticscholar   +1 more source

Codiagnosability Analysis of Discrete-Event Systems Modeled by Weighted Automata

IEEE Transactions on Automatic Control, 2019
In building failure diagnosis systems for discrete-event systems (DES), two performance indexes must be specified: first, the maximum time the diagnosis system takes to detect the failure occurrence, usually referred to as T-diagnosability, and second ...
Gustavo S. Viana, M. V. Moreira, J. Basilio   +2 more
semanticscholar   +1 more source

Coinductive Counting with Weighted Automata

J. Autom. Lang. Comb., 2003
A general methodology is developed to compute the solution of a wide variety of basic counting problems in a uniform way: (1) the objects to be counted are enumerated by means of an infinite weighted automaton; (2) the automaton is reduced by means of the quantitative notion of stream bisimulation; (3) the reduced automaton is used to compute an ...
openaire   +3 more sources

Polynomially Ambiguous Unary Weighted Automata over Fields

Theory of Computing Systems, 2022
Peter Kostolányi
semanticscholar   +1 more source

Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields

Computer Science Symposium in Russia, 2022
Peter Kostolányi
semanticscholar   +1 more source

Weighted Automata and Logics on Graphs

2015
Weighted automata model quantitative features of the behavior of systems and have been investigated for various structures like words, trees, traces, pictures, and nested words. In this paper, we introduce a general model of weighted automata acting on graphs, which form a quantitative version of Thomas’ unweighted model of graph acceptors. We derive a
Manfred Droste, Stefan Dück
openaire   +1 more source

Determinisability of unary weighted automata over the rational numbers

Theoretical Computer Science, 2021
Peter Kostolányi
semanticscholar   +1 more source

Edit-Distance of Weighted Automata

2003
The edit-distance of two strings is the minimal cost of a sequence of symbol insertions, deletions, or substitutions transforming one string into the other. The definition is used in various contexts to give a measure of the difference or similarity between two strings.
openaire   +1 more source

The Big-O Problem for Labelled Markov Chains and Weighted Automata

International Conference on Concurrency Theory, 2020
D. Chistikov, S. Kiefer, A. Murawski, David Purser   +3 more
semanticscholar   +1 more source

Weighted automata are compact and actively learnable

Information Processing Letters, 2021
Artem Kaznatcheev, Prakash Panangaden
exaly