Computational and logical aspects of infinite monoids

Markus Lohrey
The present work contains a treatise of several computational and logical aspects of infinite monoids. The first chapter is devoted to the word problem for finitely generated monoids. In particular, the relationship between the the computational complexity of the word problem and the syntactical properties of monoid presentations is investigated. The second chapter studies Cayley-graphs of finitely generated monoids under a logical point of view. Cayley-graphs of groups play an important role in combinatorial group...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.