On the theory of one-step rewriting in trace monoids

DOI10.1007/3-540-45465-9_64MaRDI QIDQ4737205zbMATH OpenFDO

Authors Markus Lohrey, Dietrich Kuske

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2380/23800752.htm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Decidable first-order theories of one-step rewriting in trace monoids
• Confluence problems for trace rewriting systems
• One-rule trace-rewriting systems and confluence
• The first-order theory of linear one-step rewriting is undecidable
• The first-order theory of one-step rewriting is undecidable

Cited in

(6)

• Decidable first-order theories of one-step rewriting in trace monoids
• Confluence problems for trace rewriting systems
• Undecidability of the first order theory of one-step right ground rewriting
• On confluence versus strong confluence for one-rule trace-rewriting systems
• One-rule trace-rewriting systems and confluence
• Trace rewriting systems

This page was built for publication: On the theory of one-step rewriting in trace monoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737205)