Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
From MaRDI portal
Publication:5390010
DOI10.4230/LIPIcs.STACS.2009.1850zbMath1236.68172MaRDI QIDQ5390010
Daniel Kirsten, Sylvain Lombardy
Publication date: 24 April 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_640e.html
Related Items
Limited Non-determinism Hierarchy of Counter Automata, Unnamed Item, Unnamed Item, Unnamed Item, Multi-Valued Reasoning about Reactive Systems, Unambiguity in Automata Theory, Weak Cost Register Automata are Still Powerful, Polynomially ambiguous unary weighted automata over fields, Bideterministic weighted automata, Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata, Rigorous approximated determinization of weighted automata, Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring, Finite sequentiality of unambiguous max-plus tree automata, Determinisability of unary weighted automata over the rational numbers, Max-plus automata, Finite ambiguity and finite sequentiality in weighted automata over fields, A robust class of linear recurrence sequences, New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems, A disambiguation algorithm for weighted automata, When are emptiness and containment decidable for probabilistic automata?, On the Disambiguation of Weighted Automata, Degree of Sequentiality of Weighted Automata, Unnamed Item, Factorization Forests, How to Tackle Integer Weighted Automata Positivity
