Name
Abstract | ||
|---|---|---|
We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization of graded submonoids in virtually free groups as quasi-geodesic submonoids, and show that their word problem is rational (as a relation). We also solve the isomorphism problem for this class of monoids, generalizing earlier results for submonoids of free monoids. We also prove that the classes of graded monoids, regular monoids and Kleene monoids coincide for submonoids of free groups. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1515/gcc-2018-0008 | GROUPS COMPLEXITY CRYPTOLOGY |
Keywords | Field | DocType |
Free group, virtually free group, submonoids, graded monoid, rational monoid, Kleene monoids, decidability | Finitely-generated abelian group,Pure mathematics | Journal |
Volume | Issue | ISSN |
10 | 2 | 1867-1144 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pedro V. Silva | 1 | 141 | 29.42 |
| Alexander Zakharov | 2 | 0 | 1.35 |