Results 1 to 10 of about 31,589 (286)
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 +6 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 +11 more sources
Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases [PDF]
Language and Automata Theory and Applications14th International Conference, 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 +4 more sources
Quantitative Automata under Probabilistic Semantics [PDF]
Logical Methods in Computer Science, 2019 Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of quantitative functions,
Krishnendu Chatterjee +2 more
doaj +3 more sources
Hyper-Minimization for Deterministic Weighted Tree Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Hyper-minimization is a state reduction technique that allows a finite change in the semantics. The theory for hyper-minimization of deterministic weighted tree automata is provided.
Andreas Maletti, Daniel Quernheim
doaj +4 more sources
Automata Minimization: a Functorial Approach [PDF]
Logical Methods in Computer Science, 2020 In this paper we regard languages and their acceptors - such as deterministic or weighted automata, transducers, or monoids - as functors from input categories that specify the type of the languages and of the machines to categories that specify the type
Thomas Colcombet, Daniela Petrişan
doaj +5 more sources
Weighted Automata and Monadic Second Order Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Let S be a commutative semiring. M. Droste and P. Gastin have introduced in 2005 weighted monadic second order logic WMSOL with weights in S. They use a syntactic fragment RMSOL of WMSOL to characterize word functions (power series) recognizable by ...
Nadia Labai, Johann A. Makowsky
doaj +4 more sources
Weighted Pushdown Systems with Indexed Weight Domains [PDF]
Logical Methods in Computer Science, 2016 The reachability analysis of weighted pushdown systems is a very powerful technique in verification and analysis of recursive programs. Each transition rule of a weighted pushdown system is associated with an element of a bounded semiring representing ...
Yasuhiko Minamide
doaj +3 more sources
A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings [PDF]
Logical Methods in Computer Science, 2023 This paper connects the classes of weighted alternating finite automata (WAFA), weighted finite tree automata (WFTA), and polynomial automata (PA). First, we investigate the use of trees in the run semantics for weighted alternating automata and prove ...
Gustav Grabolle
doaj +1 more source
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 +1 more source