Deciding the NTS property of context-free grammars

DOI10.1007/3-540-58131-6_41zbMath1529.68132OpenAlexW1541907309MaRDI QIDQ6142875

Joost Engelfriet

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58131-6_41

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Decidable sentences of Church-Rosser congruences
• On weakly confluent monadic string-rewriting systems
• The equivalence and inclusion problems for NTS languages
• NTS languages are deterministic and congruential

This page was built for publication: Deciding the NTS property of context-free grammars