Some properties of finite special string-rewriting systems

DOI10.1016/0747-7171(92)90012-SzbMath0768.68073MaRDI QIDQ1201349

Louxin Zhang

Publication date: 17 January 1993

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

decision problemsword problemsemi-Thue systemsstring-rewriting systemsMarkov property of finitely presented special monoids

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

On one-relator groups and units of special one-relation inverse monoids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive unsolvability of group theoretic problems
• Decision problems for finite special string-rewriting systems that are confluent on some congruence class
• Thue systems as rewriting systems
• On deciding the confluence of a finite string-rewriting system on a given congruence class
• It is undecidable whether a finite special string-rewriting system presents a group
• Undecidable questions related to Church-Rosser Thue systems

This page was built for publication: Some properties of finite special string-rewriting systems