Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0304-3975(03)00101-4 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
particular case,finite subset F,homomorphism problem,symmetric problem,monoid homomorphism,trace monoids,isomorphism problem,dependency alphabet | Journal | 307 |
Issue | ISSN | Citations |
1 | Theoretical Computer Science | 0 |
PageRank | References | Authors |
0.34 | 5 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pedro V. Silva | 1 | 141 | 29.42 |