Reachability in Unions of Commutative Rewriting Systems Is Decidable

DOI10.1007/978-3-540-70918-3_53MaRDI QIDQ3590971zbMATH OpenOpenAlexFDO

Authors Mikołaj Bojańczyk, Piotr Hoffman

Publication date 3 September 2007

Published in STACS 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70918-3_53

zbMATH Keywords

logic in computer sciencerewriting

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Decidability of reachability for disjoint union of term rewriting systems
• Algorithms and reductions for rewriting problems
• On deciding confluence of finite string-rewriting systems modulo partial commutativity
• scientific article; zbMATH DE number 3878366
• scientific article; zbMATH DE number 789389

Cited in

(4)

• On deciding the confluence of a finite string-rewriting system on a given congruence class
• Decidability of reachability for disjoint union of term rewriting systems
• Some decidability results on one-pass reductions
• Reachability via cooperating morphisms

This page was built for publication: Reachability in Unions of Commutative Rewriting Systems Is Decidable

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