Membership for growing context-sensitive grammars is polynomial
Journal of Computer and System Sciences
Church-Rosser Thue systems and formal languages
Journal of the ACM (JACM)
An introduction to Kolmogorov complexity and its applications
An introduction to Kolmogorov complexity and its applications
Growing context-sensitive languages and Church-Rosser languages
Information and Computation
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
An Insertion into the Chomsky Hierarchy?
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Church-Rosser Languages vs. UCFL
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On Growing Context-Sensitive Languages
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
The Variable Membership Problem: Succinctness Versus Complexity
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
The Growing Context-Sensitive Languages Are the Acyclic Context-Sensitive Languages
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
McNaughton families of languages
Theoretical Computer Science
The context-splittable normal form for Church--Rosser language systems
Information and Computation - RTA 2001
Information and Computation
Information and Computation
Computation with absolutely no space overhead
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Probabilistic length-reducing automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Shrinking multi-pushdown automata
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
The boolean closure of growing context-sensitive languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
Growing Grammars and Length-reducing Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
Hi-index | 0.00 |
The class of growing context-sensitive languages (GCSL) was proposed as a naturally defined subclass of context-sensitive languages whose membership problem is solvable in polynomial time. Growing context-sensitive languages and their deterministic counterpart called Church-Rosser languages (CRL) complement the Chomsky hierarchy in a natural way, as the classes filling the gap between context-free languages and context-sensitive languages. They possess characterizations by a natural machine model, length-reducing two-pushdown automata (lrTPDA). We introduce a lower bound technique for lrTPDAs. Using this technique, we prove the conjecture of McNaughton, Narendran and Otto that the set of palindromes is not in CRL. As a consequence we obtain that CFL∩coCFL as well as UCFL∩coUCFL are not included in CRL, where UCFL denotes the class of unambiguous context-free languages; this solves an open problem posed by Beaudry, Holzer, Niemann and Otto. Another corollary is that CRL is a strict subset of GCSL∩coGCSL.