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)
Two applications of inductive counting for complementation problems
SIAM Journal on Computing
String-rewriting systems
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
Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids
Journal of Symbolic Computation
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
On Growing Context-Sensitive Languages
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Prefix Languages of Church-Rosser Languages
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
A Normal Form for Church-Rosser Language Systems
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
On the Power of Randomized Pushdown Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
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
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Information and Computation
Lower bound technique for length-reducing automata
Information and Computation
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
Probabilistic Length-Reducing Two-Pushdown Automata
Theory of Computing Systems
Information and Computation
Time-bounded grammars and their languages
Journal of Computer and System Sciences
Restarting automata and their relations to the Chomsky hierarchy
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Pushdown automata and multicounter machines, a comparison of computation modes
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Shrinking multi-pushdown automata
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
Growing context-sensitive grammars were introduced in 1986 as a restricted variant of context-sensitive grammars, where all productions are length increasing. Several interesting properties of these grammars have been shown since then, including polynomial time complexity of the membership problem and machine model characterizations. Various characterizations of the model, efficient recognition algorithm and the properties of its deterministic variant (possessing a characterization by string-rewriting systems) justify the practical value. Moreover, as pointed out by McNaughton in 1999, growing context-sensitive grammars complement the Chomsky hierarchy in a very natural way. This article reviews results on this topic and proposes some open problems.