Descriptional complexity of bounded context-free languages

DOI10.1016/J.IC.2013.03.008MaRDI QIDQ383365zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Andreas Malcher, Giovanni Pighizzini

Publication date 4 December 2013

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2013.03.008

zbMATH Keywords

automatadescriptional complexityformal languagesbounded languagesfinite-turn pushdown automatarecursive trade-offs

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Descriptional Complexity of Bounded Context-Free Languages
• On recursive and non-recursive trade-offs between finite-turn pushdown automata
• Descriptional complexity of two-way pushdown automata with restricted head reversals
• scientific article; zbMATH DE number 1439403
• Pushdown automata with bounded nondeterminism and bounded ambiguity

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 704484 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• Bounded Algol-Like Languages
• Complexity of normal form grammars
• Descriptional complexity -- an introductory survey
• Descriptional complexity of machines with limited resources
• Finite-Turn Pushdown Automata
• NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
• On One-Way Cellular Arrays
• On recursive and non-recursive trade-offs between finite-turn pushdown automata
• THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS
• Two Families of Languages Related to ALGOL
• Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.

Cited in

(8)

• On bounded languages and reversal-bounded automata
• Limited automata and unary languages
• Complexity of multi-head finite automata: origins and directions
• Descriptional Complexity of Bounded Context-Free Languages
• Descriptional complexity of two-way pushdown automata with restricted head reversals
• On bounded languages and reversal-bounded automata
• Descriptional complexity of bounded regular languages
• On recursive and non-recursive trade-offs between finite-turn pushdown automata

Describes a project that uses

Uses Software

• ALGOL 60

This page was built for publication: Descriptional complexity of bounded context-free languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383365)