Results 291 to 300 of about 1,475,237 (325)
Some of the next articles are maybe not open access.
On deterministic weighted automata
Information Processing Letters, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Weighted automata and weighted logics on infinite words
Russian Mathematics, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Manfred Droste, George Rahonis
openaire +2 more sources
ON WEIGHTED BÜCHI AUTOMATA WITH ORDER-COMPLETE WEIGHTS
International Journal of Algebra and Computation, 2007We investigate Büchi automata with weights for the transitions. Assuming that the weights are taken in a suitable ordered semiring, we show how to define the behaviors of these automata on infinite words. Our main result shows that the formal power series arising in this way are precisely the ones which can be constructed using ω-rational operations ...
Manfred Droste, Ulrike Püschmann
openaire +2 more sources
A Complexity Bound for Determinisation of Min-Plus Weighted Automata
Logic in Computer ScienceThe determinisation problem for min-plus (tropical) weighted automata was recently shown to be decidable. However, the proof is purely existential, relying on several non-constructive arguments. Our contribution in this work is twofold: first, we present
Shaull Almagor +2 more
semanticscholar +1 more source
Weighted Picture Automata and Weighted Logics
Theory of Computing Systems, 2006The author introduces a weighted MSO logic for defining series of pictures; here a picture is a finite rectangular array of symbols from a given (finite) alphabet. The main results of the paper show that the picture series over any commutative semiring definable by this logic are the same as the series recognized by weighted two-dimensional on-line ...
openaire +3 more sources
The generating power of weighted tree automata with initial algebra semantics
arXiv.orgWe 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 +3 more
semanticscholar +1 more source
Codiagnosability Analysis of Discrete-Event Systems Modeled by Weighted Automata
IEEE Transactions on Automatic Control, 2019In 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 +2 more
semanticscholar +1 more source
Coinductive Counting with Weighted Automata
J. Autom. Lang. Comb., 2003A 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
Weighted Automata and Logics on Graphs
2015Weighted 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
Polynomially Ambiguous Unary Weighted Automata over Fields
Theory of Computing Systems, 2022Peter Kostolányi
semanticscholar +1 more source