On confluence versus strong confluence for one-rule trace-rewriting systems
From MaRDI portal
Publication:4841769
DOI10.1007/BF01185402zbMath0837.68054MaRDI QIDQ4841769
Publication date: 24 July 1995
Published in: Mathematical Systems Theory (Search for Journal in Brave)
68Q42: Grammars and rewriting systems
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule
- A note on thue systems with a single defining relation
- Completion of a Set of Rules Modulo a Set of Equations
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- On confluence of one-rule trace-rewriting systems