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
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
A characterization of boolean closures of families of languages
1. Fachtagung über Automatentheorie und Formale Sprachen
The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages
Gesellschaft für Informatik e.V., 3. Jahrestagung
Information and Computation
Information and Computation
Shrinking multi-pushdown automata
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
The boolean closure of linear context-free languages
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Lower bound technique for length-reducing automata
Information and Computation
On the Computational Capacity of Parallel Communicating Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
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
Fundamenta Informaticae
| Hi-index | 0.00 |
The class of growing context-sensitive languages (GCSL) is a naturally defined subclass of context-sensitive languages whose membership problem is solvable in polynomial time. GCSL and its deterministic counterpart called Church-Rosser Languages (CRL) complement the Chomsky hierarchy in a natural way [9]. In this paper, the extension of GCSL obtained by closures of this class under the boolean operations are investigated. We show that there exists an infinite intersection hierarchy, answering an open problem from [1]. Further, we compare the expressive power of the boolean closures of GCSL, CRL, CFL and LOGCFL.