Finite canonical rewriting systems for congruences generated by concurrency relations
DOI10.1007/BF01692068zbMATH Open0638.68085MaRDI QIDQ3779772FDOQ3779772
Authors: Friedrich Otto 
Publication date: 1987
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Recommendations
- Restrictions of congruences generated by finite canonical string-rewriting systems
- The problems of cyclic equality and conjugacy for finite complete rewriting systems
- On deciding confluence of finite string-rewriting systems modulo partial commutativity
- FINITENESS CONDITIONS FOR REWRITING SYSTEMS
- Term Rewriting and Applications
- Confluence of algebraic rewriting systems
- A finiteness condition for rewriting systems
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
- scientific article; zbMATH DE number 794237
- scientific article; zbMATH DE number 1419256
polynomial timealphabetfree partially commutative monoiddecidabiltyconcurrency relationfinite canonical rewriting system
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Title not available (Why is that?)
- On theories with a combinatorial definition of 'equivalence'
- Combinatorial problems of commutation and rearrangements
- Title not available (Why is that?)
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Tree-Manipulating Systems and Church-Rosser Theorems
- A finite Thue system with decidable word problem and without equivalent finite canonical system
- On lexicographic semi-commutations
- A note on a special one-rule semi-Thue system
- Confluent and Other Types of Thue Systems
- Complete semi-Thue systems for abelian groups
- Finite complete rewriting systems and the complexity of word problem
- A note on special thue systems with a single defining relation
- A note on thue systems with a single defining relation
Cited In (10)
- On deciding confluence of finite string-rewriting systems modulo partial commutativity
- Canonized Rewriting and Ground AC Completion Modulo Shostak Theories
- A finiteness condition for rewriting systems
- Title not available (Why is that?)
- On deciding the confluence of a finite string-rewriting system on a given congruence class
- Weights for total division orderings on strings
- Möbius functions and confluent semi-commutations
- The problems of cyclic equality and conjugacy for finite complete rewriting systems
- Restrictions of congruences generated by finite canonical string-rewriting systems
- Title not available (Why is that?)
This page was built for publication: Finite canonical rewriting systems for congruences generated by concurrency relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3779772)
