Please login to be able to save your searches and receive alerts for new content matching your search criteria.
A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating set. This paper considers the natural generalizations of these concepts to semigroups and monoids. Two distinct potential generalizations to monoids are shown to be equivalent. Various interesting examples are presented, including an example of a non-Markov monoid that nevertheless admits a regular language of unique representatives over any generating set. It is shown that all finitely generated commutative semigroups are strongly Markov, but that finitely generated subsemigroups of virtually abelian or polycyclic groups need not be. Potential connections with word-hyperbolic semigroups are investigated. A study is made of the interaction of the classes of Markov and strongly Markov semigroups with direct products, free products, and finite-index subsemigroups and extensions. Several questions are posed.
In this paper, we introduce an extension of the fellow traveler property which allows fellow travelers to be at distance bounded from above by a function f(n) growing slower than any linear function. We study normal forms satisfying this extended fellow traveler property and certain geometric constraints that naturally generalize two fundamental properties of an automatic normal form — the regularity of its language and the bounded length difference property. We show examples of such normal forms and prove some nonexistence theorems.