Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata

DOI10.1007/978-3-642-15349-5_1zbMath1287.68097OpenAlexW1601640063MaRDI QIDQ3584958

Martin Kutrib, Markus Holzer

Publication date: 31 August 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15349-5_1

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct ⋮ Operations on Unambiguous Finite Automata ⋮ Unambiguity in Automata Theory

This page was built for publication: Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata