On the Knuth-Bendix completion for concurrent processes
From MaRDI portal
Publication:1262753
DOI10.1016/0304-3975(89)90131-XzbMath0686.68023WikidataQ127396247 ScholiaQ127396247MaRDI QIDQ1262753
Publication date: 1989
Published in: Theoretical Computer Science (Search for Journal in Brave)
word problemconcurrent processesquotient monoidfree partially commutative monoidfinite replacement system
Symbolic computation and algebraic computation (68W30) Abstract data types; algebraic specification (68Q65) Semigroups in automata theory, linguistics, etc. (20M35) Theory of operating systems (68N25) Algorithms in computer science (68W99) Thue and Post systems, etc. (03D03)
Related Items (3)
One-rule trace-rewriting systems and confluence ⋮ Word problems over traces which are solvable in linear time ⋮ Finding k Partially Disjoint Paths in a Directed Planar Graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial commutations and faithful rational transductions
- Complete semi-Thue systems for abelian groups
- Rewriting systems and word problems in a free partially commutative monoid
- Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule
- The word problem for free partially commutative groups
- New decision algorithms for finitely presented commutative semigroups
- Presentations of groups and monoids
- Undecidable questions related to Church-Rosser Thue systems
- Recognizable subsets of some partially Abelian monoids
- Combinatorial problems of commutation and rearrangements
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Confluent and Other Types of Thue Systems
- Word problems over traces which are solvable in linear time
This page was built for publication: On the Knuth-Bendix completion for concurrent processes
