The homomorphism problem for trace monoids.

DOI10.1016/S0304-3975(03)00101-4zbMath1042.20042OpenAlexW2059616690MaRDI QIDQ1426045

Pedro V. Silva

Publication date: 14 March 2004

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00101-4

zbMATH Keywords

homomorphismsdecidabilitytrace monoids

Mathematics Subject Classification ID

Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05) Mappings of semigroups (20M15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synchronized rational relations of finite and infinite words
• Some algorithms on the star operation applied to finite languages
• Easy multiplications. I: The realm of Kleene's theorem
• Quelques constructions et algorithmes rélatifs aux sous-monoides d'un monoide libre
• A note on decidability questions on presentations of word semigroups
• The homomorphism problem for the free monoid
• On finitely generated subsemigroups of a free semigroup
• On graph products of automatic monoids

This page was built for publication: The homomorphism problem for trace monoids.