Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/de-gruyter/on-finitely-generated-submonoids-of-virtually-free-groups-FE7y9jy7oz
References
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
- Publisher
- de Gruyter
- Copyright
- © 2018 Walter de Gruyter GmbH, Berlin/Boston
- ISSN
- 1869-6104
- eISSN
- 1869-6104
- DOI
- 10.1515/gcc-2018-0008
- Publisher site
- See Article on Publisher Site
Abstract
AbstractWe 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.
Journal
Groups Complexity Cryptology – de Gruyter
Published: Nov 1, 2018