One-rule trace-rewriting systems and confluence

DOI10.1007/3-540-55808-X_50zbMath1493.68180OpenAlexW1499505013MaRDI QIDQ5096864

No author found.

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55808-x_50

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

The word problem for one-relation monoids: a survey

Cites Work

• On some equations in free partially commutative monoids
• Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule
• Combinatorics on traces
• On the Knuth-Bendix completion for concurrent processes
• On deciding confluence of finite string-rewriting systems modulo partial commutativity
• Overlaps in free partially commutative monoids
• Completion of a Set of Rules Modulo a Set of Equations
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Confluence of one-rule Thue systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: One-rule trace-rewriting systems and confluence