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
String-rewriting systems
Growing context-sensitive languages and Church-Rosser languages
Information and Computation
Confluent and Other Types of Thue Systems
Journal of the ACM (JACM)
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
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
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
Observation of String-Rewriting Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Lower bound technique for length-reducing automata
Information and Computation
Computing by observing: Simple systems and simple observers
Theoretical Computer Science
Regular languages are church-rosser congruential
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Observation of String-Rewriting Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
| Hi-index | 0.00 |
In this paper the context-splittable normal form for rewriting 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. Some interesting consequences of this characterization are given, too.