On the Succinctness of Nondeterminism

DOI10.1007/11901914_12zbMath1161.68508OpenAlexW1551895525MaRDI QIDQ3522904

Orna Kupferman, Benjamin Aminof

Publication date: 4 September 2008

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11901914_12

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (1)

On Repetition Languages

This page was built for publication: On the Succinctness of Nondeterminism