Descriptional Complexity of Bounded Context-Free Languages

DOI10.1007/978-3-540-73208-2_30zbMath1202.68233OpenAlexW1925197043MaRDI QIDQ5428242

Andreas Malcher, Giovanni Pighizzini

Publication date: 28 November 2007

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73208-2_30

zbMATH Keywords

bounded languagesdescriptional complexityfinite-turn pushdown automatarecursive trade-offs

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Parikh’s Theorem and Descriptional Complexity ⋮ On bounded languages and reversal-bounded automata ⋮ Descriptional complexity of two-way pushdown automata with restricted head reversals ⋮ Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals

This page was built for publication: Descriptional Complexity of Bounded Context-Free Languages