A TREE-HEIGHT HIERARCHY OF CONTEXT-FREE LANGUAGES
From MaRDI portal
Publication:3401487
DOI10.1142/S012905410700542XzbMath1191.68402MaRDI QIDQ3401487
Publication date: 29 January 2010
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (3)
TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES ⋮ On the synchronized derivation depth of context-free grammars ⋮ New Results on the Minimum Amount of Useful Space
Cites Work
This page was built for publication: A TREE-HEIGHT HIERARCHY OF CONTEXT-FREE LANGUAGES