Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata
From MaRDI portal
Publication:5390010
DOI10.4230/LIPICS.STACS.2009.1850zbMATH Open1236.68172OpenAlexW1735667100MaRDI QIDQ5390010FDOQ5390010
Authors: Daniel Kirsten, Sylvain Lombardy 
Publication date: 24 April 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_640e.html
Recommendations
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Finite sequentiality of unambiguous max-plus tree automata
- scientific article; zbMATH DE number 7559164
- scientific article; zbMATH DE number 2040921
- Which finitely ambiguous automata recognize finitely sequential functions? (extended abstract)
Cited In (32)
- Bideterministic weighted automata
- Unambiguous automata denoting finitely sequential functions
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
- Limited non-determinism hierarchy of counter automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to Tackle Integer Weighted Automata Positivity
- Polynomially ambiguous unary weighted automata over fields
- Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata
- New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems
- Finitely ambiguous and finitely sequential weighted automata over fields
- Unambiguity and fewness for nonuniform families of polynomial-size nondeterministic finite automata
- Weak cost register automata are still powerful
- A robust class of linear recurrence sequences
- Finite sequentiality of finitely ambiguous max-plus tree automata
- Factorization Forests
- Which finitely ambiguous automata recognize finitely sequential functions? (extended abstract)
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Title not available (Why is that?)
- Pumping lemmas for weighted automata
- A disambiguation algorithm for weighted automata
- Finite sequentiality of unambiguous max-plus tree automata
- Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
- Determinisability of unary weighted automata over the rational numbers
- On the disambiguation of weighted automata
- When are emptiness and containment decidable for probabilistic automata?
- Unambiguity in automata theory
- Max-plus automata
- Degree of sequentiality of weighted automata
- Multi-Valued Reasoning about Reactive Systems
- Rigorous approximated determinization of weighted automata
- Finite ambiguity and finite sequentiality in weighted automata over fields
This page was built for publication: Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5390010)
