Removing Nondeterminism in Constant Height Pushdown Automata

DOI10.1007/978-3-642-31623-4_6zbMath1304.68092OpenAlexW48751100MaRDI QIDQ3167573

Viliam Geffert, Zuzana Bednárová, Beatrice Palano, Carlo Mereghetti

Publication date: 2 November 2012

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31623-4_6

zbMATH Keywords

regular languagesdeterministic pushdown automatadescriptional complexityfinite state automatanondeterministic pushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Two double-exponential gaps for automata with a limited pushdown

This page was built for publication: Removing Nondeterminism in Constant Height Pushdown Automata