Results 11 to 20 of about 1,475,237 (325)
Pumping lemmas for weighted automata [PDF]
Logical Methods in Computer Science, 2021 We present pumping lemmas for five classes of functions definable by fragments of weighted automata over the min-plus semiring, the max-plus semiring and the semiring of natural numbers. As a corollary we show that the hierarchy of functions definable by
Agnishom Chattopadhyay +3 more
doaj +5 more sources
Weighted Automata over Vector Spaces [PDF]
International Conference on Automata and Formal Languages, 2023 In this paper we deal with three models of weighted automata that take weights in the field of real numbers. The first of these models are classical weighted finite automata, the second one are crisp-deterministic weighted automata, and the third one are
Nada Damljanovic +2 more
semanticscholar +3 more sources
Nested Weighted Automata [PDF]
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015 Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed ...
Krishnendu Chatterjee +2 more
core +6 more sources
Feasability of Learning Weighted Automata on a Semiring [PDF]
Logical Methods in Computer Science, 2023 Since the seminal work by Angluin and the introduction of the L*-algorithm, active learning of automata by membership and equivalence queries has been extensively studied to learn various extensions of automata.
Laure Daviaud, Marianne Johnson
doaj +3 more sources
Synchronizing weighted automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We introduce two generalizations of synchronizability to automata with transitions weighted in an arbitrary semiring K=(K,+,*,0,1). (or equivalently, to finite sets of matrices in K^nxn.) Let us call a matrix A location-synchronizing if there exists a ...
Szabolcs Iván
doaj +5 more sources
Pebble Weighted Automata and Weighted Logics [PDF]
ACM Transactions on Computational Logic, 2014 We introduce new classes of weighted automata on words. Equipped with pebbles, they go beyond the class of recognizable formal power series: they capture weighted first-order logic enriched with a quantitative version of transitive closure. In contrast to previous work, this calculus allows for unrestricted use of existential and universal ...
Bollig, Benedikt +3 more
openaire +4 more sources
Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases [PDF]
Language and Automata Theory and Applications, 2020 This paper surveys some results regarding decision problems for probabilistic and max-plus automata, such as containment and equivalence. Probabilistic and max-plus automata are part of the general family of weighted automata, whose semantics are maps ...
Daviaud L.
europepmc +2 more sources
On Determinism and Unambiguity of Weighted Two-way Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 In this paper, we first study the conversion of weighted two-way automata to one-way automata. We show that this conversion preserves the unambiguity but does not preserve the determinism.
Vincent Carnino, Sylvain Lombardy
doaj +3 more sources
Bisimulation Metrics for Weighted Automata [PDF]
CoRR, 2017 We develop a new bisimulation (pseudo)metric for weighted finite automata (WFA) that generalizes Boreale's linear bisimulation relation. Our metrics are induced by seminorms on the state space of WFA. Our development is based on spectral properties of sets of linear operators.
Balle, Borja +2 more
openaire +7 more sources
Weighted automata and weighted logics with discounting
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Manfred Droste, George Rahonis
openaire +4 more sources