On lexicographic semi-commutations

DOI10.1016/0020-0190(87)90037-8zbMath0654.68095OpenAlexW2034001113MaRDI QIDQ1108811

Edward Ochmański, Yves Métivier

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90037-8

zbMATH Keywords

lexicographic ordertracecommunication graphscomplete rewriting systemcommutation monoidsemi-commutation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Abstract data types; algebraic specification (68Q65) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (4)

Finite canonical rewriting systems for congruences generated by concurrency relations ⋮ A canonical automaton for one-rule length-preserving string rewrite systems ⋮ Möbius functions and confluent semi-commutations ⋮ Semicommutations and algebraic languages

Cites Work

• Semi-commutations
• Recognizable subsets of some partially Abelian monoids
• Combinatorial problems of commutation and rearrangements
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• A Characterization of Comparability Graphs and of Interval Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On lexicographic semi-commutations