Easy multiplications. I. The realm of Kleene's theorem
Information and Computation
Synchronized rational relations of finite and infinite words
Theoretical Computer Science - Selected papers of the International Colloquium on Words, Languages and Combinatorics, Kyoto, Japan, August 1990
A note on decidability questions on presentations of word semigroups
Theoretical Computer Science - Special issue: formal language theory
The Book of Traces
Word Processing in Groups
Theory of Codes
The homomorphism problem for the free monoid
Discrete Mathematics
Formal languages and their relation to automata
Formal languages and their relation to automata
| Hi-index | 0.00 |
It is proved to be decidable, for any given finite subset F of X*, dependency alphabet (Y, τ) and mapping φ : F → Y*, whether or not φ can be extended to a monoid homomorphism φ : F* → M(Y,τ). This contrasts with the undecidability of the symmetric problem, when we consider the dependency alphabet (X, τ) instead. Some other particular cases of homomorphism and isomorphism problems among trace monoids are also discussed.