n-level rewriting systems

DOI10.1016/0304-3975(85)90160-4zbMath0606.68025OpenAlexW2121691985MaRDI QIDQ1084855

Günther Bauer

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90160-4

zbMATH Keywords

finite complete 2-level rewriting systemsfinitely presentable recursive monoids

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Abstract data types; algebraic specification (68Q65)

Related Items

Open problems in rewriting ⋮ Thue systems as rewriting systems ⋮ About the descriptive power of certain classes of finite string-rewriting systems

Cites Work

• Finite complete rewriting systems and the complexity of word problem
• A note on a special one-rule semi-Thue system
• A finite Thue system with decidable word problem and without equivalent finite canonical system
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Confluent and Other Types of Thue Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item