On confluence of one-rule trace-rewriting systems
From MaRDI portal
Publication:4841768
DOI10.1007/BF01185401zbMath0837.68055OpenAlexW2054875301MaRDI QIDQ4841768
No author found.
Publication date: 24 July 1995
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01185401
Related Items
On confluence versus strong confluence for one-rule trace-rewriting systems, Confluence of one-rule Thue systems, The word problem for one-relation monoids: a survey, Synchronization expressions with extended join operation, On normalizing, non-terminating one-rule string rewriting systems, Confluence problems for trace rewriting systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The undecidability of the preperfectness of Thue systems
- Partial commutations and faithful rational transductions
- On some equations in free partially commutative monoids
- 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
- Testing for the Church-Rosser property
- Combinatorics on traces
- On deciding confluence of finite string-rewriting systems modulo partial commutativity
- Recognizable subsets of some partially Abelian monoids
- Calcul de longueurs de chaînes de réécriture dans le monoïde libre
- Overlaps in free partially commutative monoids
- Efficient solution of some problems in free partially commutative monoids
- A note on thue systems with a single defining relation
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Confluent and Other Types of Thue Systems
- A note on special thue systems with a single defining relation
- On confluence versus strong confluence for one-rule trace-rewriting systems
