Name
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*. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0012-365X(02)00380-1 | Discrete Mathematics |
Keywords | Field | DocType |
free monoid,finite subsets f,isomorphism problem,20m05,decidability,isomorphism,finite subset f,homomorphism problem,homomorphism,68r15,monoid homomorphism,alternative algorithm | Discrete mathematics,Combinatorics,Injective function,Group theory,Decidability,Monoid,Isomorphism,Syntactic monoid,Homomorphism,Free monoid,Mathematics | Journal |
Volume | Issue | ISSN |
259 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.40 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pedro V. Silva | 1 | 141 | 29.42 |