Limited Non-determinism Hierarchy of Counter Automata

DOI10.1007/978-3-642-37064-9_10zbMath1377.68102OpenAlexW243230860MaRDI QIDQ4910447

Sebastian Bala, Dariusz Jackowski

Publication date: 18 March 2013

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-37064-9_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
• Finite-valued distance automata
• OpenFst: A General and Efficient Weighted Finite-State Transducer Library
• R-Automata
• The Theory of Stabilisation Monoids and Regular Cost Functions
• Distance automata having large finite distance or finite ambiguity
• Foundations of Software Science and Computation Structures
• Distance desert automata and the star height problem
• Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
• Unnamed Item

This page was built for publication: Limited Non-determinism Hierarchy of Counter Automata