The context-splittable normal form for Church-Rosser language systems.

DOI10.1016/S0890-5401(03)00035-XzbMath1054.68082MaRDI QIDQ1401938

Jens R. Woinowski

Publication date: 19 August 2003

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

String-rewritingChurch-Rosser languagesConfluenceGrowing context-sensitive languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (2)

Lower bound technique for length-reducing automata ⋮ Computing by observing: simple systems and simple observers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Membership for growing context-sensitive grammars is polynomial
• An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems
• Growing context-sensitive languages and Church-Rosser languages
• McNaughton families of languages.
• On certain formal properties of grammars
• Church-Rosser Thue systems and formal languages
• Confluent and Other Types of Thue Systems

This page was built for publication: The context-splittable normal form for Church-Rosser language systems.