Two Double-Exponential Gaps for Automata with a Limited Pushdown

DOI10.1007/978-3-319-04921-2_9zbMath1362.68126OpenAlexW40541673MaRDI QIDQ5404905

Viliam Geffert, Zuzana Bednárová

Publication date: 31 March 2014

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-319-04921-2_9

zbMATH Keywords

regular languagespushdown automatadescriptional complexityfinite state automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Boolean language operations on nondeterministic automata with a pushdown of constant height ⋮ Removing nondeterminism in constant height pushdown automata

This page was built for publication: Two Double-Exponential Gaps for Automata with a Limited Pushdown