Codes modulo finite monadic string-rewriting systems
From MaRDI portal
Publication:1341747
DOI10.1016/0304-3975(94)90284-4zbMath0824.68057OpenAlexW2079790373MaRDI QIDQ1341747
Paliath Narendran, Friedrich Otto
Publication date: 6 November 1995
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90284-4
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decidable sentences of Church-Rosser congruences
- On weakly confluent monadic string-rewriting systems
- Decision problems for finite special string-rewriting systems that are confluent on some congruence class
- Some undecidability results for non-monadic Church-Rosser Thue systems
- The base of the intersection of two free submonoids
- A closure property of regular languages
- When is an extension of a specification consistent? Decidable and undecidable cases
- The Knuth-Bendix Completion Procedure and Thue Systems
- Confluent and Other Types of Thue Systems