Finite-valued distance automata
From MaRDI portal
Publication:1341750
DOI10.1016/0304-3975(94)90287-9zbMath0938.68709OpenAlexW2045668977MaRDI QIDQ1341750
Publication date: 15 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90287-9
Related Items (15)
Exponential upper and lower bounds for the order of a regular language ⋮ Unnamed Item ⋮ Distance desert automata and the star height problem ⋮ Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata ⋮ A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata ⋮ Limited Non-determinism Hierarchy of Counter Automata ⋮ Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton ⋮ Sequential? ⋮ Component simulation-based substitutivity managing QoS and composition issues ⋮ Series which are both max-plus and min-plus rational are unambiguous ⋮ Unnamed Item ⋮ How to Tackle Integer Weighted Automata Positivity ⋮ Max-plus automata ⋮ Unnamed Item ⋮ Decomposing a $k$-valued transducer into $k$ unambiguous ones
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limitedness theorem on finite automata with distance functions: An algebraic proof
- Improved limitedness theorems on finite automata with distance functions
- Limitedness theorem on finite automata with distance functions
- On the valuedness of finite transducers
- The complexity of decision problems for finite-turn multicounter machines
- On the relation between ambiguity and nondeterminism in finite automata
- A note on finitely ambiguous distance automata
- Some consequences of a Fatou property of the tropical semiring
- Exponential upper and lower bounds for the order of a regular language
- A note on finite-valued and finitely ambiguous transducers
- Distance automata having large finite distance or finite ambiguity
- Finite automata having cost functions: Nondeterministic models
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
This page was built for publication: Finite-valued distance automata
