17 research outputs found
The monoid of queue actions
We investigate the monoid of transformations that are induced by sequences of
writing to and reading from a queue storage. We describe this monoid by means
of a confluent and terminating semi-Thue system and study some of its basic
algebraic properties, e.g., conjugacy. Moreover, we show that while several
properties concerning its rational subsets are undecidable, their uniform
membership problem is NL-complete. Furthermore, we present an algebraic
characterization of this monoid's recognizable subsets. Finally, we prove that
it is not Thurston-automatic
Higher rank lamplighter groups are graph automatic
We show that the higher rank lamplighter groups, or Diestel-Leader groups
for , are graph automatic. This introduces a new family
of graph automatic groups which are not automatic
Thompson's group F is 1-counter graph automatic
© 2016 by De Gruyter. It is not known whether Thompson's group F is automatic. With the recent extensions of the notion of an automatic group to graph automatic by Kharlampovich, Khoussainov and Miasnikov and then to C-graph automatic by the authors, a compelling question is whether F is graph automatic or C-graph automatic for an appropriate language class C. The extended definitions allow the use of a symbol alphabet for the normal form language, replacing the dependence on generating set. In this paper we construct a 1-counter graph automatic structure for F based on the standard infinite normal form for group elements