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)
Confluent string rewriting
Growing context-sensitive languages and Church-Rosser languages
Information and Computation
Confluent and Other Types of Thue Systems
Journal of the ACM (JACM)
An Insertion into the Chomsky Hierarchy?
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Prefix Languages of Church-Rosser Languages
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
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
Growing Grammars and Length-reducing Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
| Hi-index | 0.00 |
In this paper the context-splittable normal form for rewritings systems defining Church-Rosser languages is introduced. Context-splittable rewriting rules look like rules of context-sensitive grammars with swapped sides. To be more precise, they have the form uvw → uxw with u, v, w being words, v being nonempty and x being a single letter or the empty word. It is proved that this normal form can be achieved for each Church-Rosser language and that the construction is effective.