The homomorphism problem for the free monoid

Authors:
Pedro V. Silva
Affiliations:
Centro de Matemática, Universidade do Porto, R. Campo Alegre 687, 4169-007 Porto, Portugal
Venue:
Discrete Mathematics
Year:
2002

Citing 6
Cited 1

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
Word Processing in Groups

Word Processing in Groups
Theory of Codes

Theory of Codes
Formal languages and their relation to automata

Formal languages and their relation to automata

The homomorphism problem for trace monoids

Theoretical Computer Science - WORDS

Quantified Score

Hi-index	0.05

Visualization

Abstract

It is proved to be decidable, for any given finite subset F of X* and mapping φ:F* → X*, whether or not φ can be extended to an (injective) monoid homomorphism φ:F* → X*. As a corollary, an alternative algorithm for the isomorphism problem for the free monoid is also provided: for any given finite subsets F, G of X*, it is decidable whether or not F* ≃ G*.