Descriptional complexity of bounded context-free languages
DOI10.1016/J.IC.2013.03.008zbMATH Open1358.68173DBLPjournals/iandc/MalcherP13OpenAlexW1983646390WikidataQ61677498 ScholiaQ61677498MaRDI QIDQ383365FDOQ383365
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
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
automatadescriptional complexityformal languagesbounded languagesfinite-turn pushdown automatarecursive trade-offs
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounded Algol-Like Languages
- Title not available (Why is that?)
- Descriptional complexity -- an introductory survey
- Descriptional complexity of machines with limited resources
- THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.
- On recursive and non-recursive trade-offs between finite-turn pushdown automata
- On One-Way Cellular Arrays
- Title not available (Why is that?)
- Finite-Turn Pushdown Automata
- Two Families of Languages Related to ALGOL
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- Complexity of normal form grammars
Cited In (8)
- On recursive and non-recursive trade-offs between finite-turn pushdown automata
- 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
- Descriptional complexity of bounded regular languages
- On bounded languages and reversal-bounded automata
Uses Software
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)
