Automata, Languages and Programming

DOI10.1007/11523468zbMath1082.68052OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716791

Juraj Hromkovič, Georg Schnitger

Publication date: 10 January 2006

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Transition complexity of language operations ⋮ On the average state and transition complexity of finite languages

This page was built for publication: Automata, Languages and Programming