NTS grammars and Church-Rosser systems

DOI10.1016/0020-0190(81)90036-3zbMath0476.68053OpenAlexW2075454140MaRDI QIDQ1159985

Ronald V. Book

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90036-3

zbMATH Keywords

context-free grammarsThue systemmonadic Church-Rosser systemsnonterminal separated grammarsentential forms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Thue and Post systems, etc. (03D03)

Related Items (5)

The equivalence and inclusion problems for NTS languages ⋮ NTS languages are deterministic and congruential ⋮ On the generating power of regularly controlled bidirectional grammars ⋮ Learning deterministic context free grammars: the Omphalos competition ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Testing for the Church-Rosser property
• Monadic Thue systems
• Une généralisation des ensembles de Dyck
• On theories with a combinatorial definition of 'equivalence'
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Confluent and Other Types of Thue Systems

This page was built for publication: NTS grammars and Church-Rosser systems