scientific article; zbMATH DE number 7559164
From MaRDI portal
Publication:5090506
DOI10.4230/LIPIcs.STACS.2019.55MaRDI QIDQ5090506
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Ambiguity Hierarchies for Weighted Tree Automata ⋮ Finite sequentiality of unambiguous max-plus tree automata
Cites Work
- Coarse-to-fine natural language processing
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
- Handbook of weighted automata
- Algorithms for determining relative star height and star height
- On the degree of ambiguity of finite automata
- Sur les rélations rationnelles entre monoides libres
- A construction on finite automata that has remained hidden
- On the finite degree of ambiguity of finite tree automata
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring
- Which Finitely Ambiguous Automata Recognize Finitely Sequential Functions?
- On the definition of a family of automata
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
- Automata that recognize intersections of free submonoids
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA
- Unambiguous Automata Denoting Finitely Sequential Functions
- Weighted Automata Algorithms
- Comparison of max-plus automata and joint spectral radius of tropical matrices
- Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: