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
A New Approach to Formal Language Theory by Kolmogorov Complexity
SIAM Journal on Computing
Growing context-sensitive languages and Church-Rosser languages
Information and Computation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
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
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Degrees of non-monotonicity for restarting automata
Theoretical Computer Science
Lower bound technique for length-reducing automata
Information and Computation
Restarting automata and their relations to the Chomsky hierarchy
DLT'03 Proceedings of the 7th international conference on Developments in language theory
On lexicalized well-behaved restarting automata that are monotone
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Transductions computed by PC-systems of monotone deterministic restarting automata
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Probabilistic length-reducing automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The boolean closure of growing context-sensitive languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Expressive power of LL(k) Boolean grammars
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| 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. In this paper we concentrate on the class of Church Rosser Languages (CRL), the "deterministic counterpart" of GCSL. We prove the conjecture (stated in [9]) that the set of palindromes is not in CRL. This implies that CFL驴co-CFL as well as UCFL驴co-UCFL are not included in CRL, where UCFL denotes the class of unambiguous context-free languages. Our proof uses a novel pumping technique, which is of independent interest.