Möbius functions and confluent semi-commutations

DOI10.1016/0304-3975(93)90229-MzbMath0777.68052MaRDI QIDQ685454

Volker Diekert

Publication date: 20 December 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Möbius functionsconfluenceliftingscommutative monoids

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Thue and Post systems, etc. (03D03)

Related Items

Clique polynomials have a unique root of smallest modulus ⋮ Determinants and Möbius functions in trace monoids ⋮ Number of prefixes in trace monoids: clique polynomials and dependency graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A remark on the representation of trace monoids
• Graphs and free partially commutative monoids
• Complete rewriting systems and homology of monoid algebras
• Word problems and a homological finiteness condition for monoids
• Theory of traces
• On lexicographic semi-commutations
• Combinatorics on traces
• Combinatorial problems of commutation and rearrangements
• On theories with a combinatorial definition of 'equivalence'
• Finite canonical rewriting systems for congruences generated by concurrency relations