Star-Free Geodesic Languages for Groups

In this article we show that every group with a finite presentation satisfying one or both of the small cancellation conditions C′(1/6) and C′(1/4) - T(4) has the property that the set of all geodesics (over the same generating set) is a star-free regular language. Star-free regularity of the geodesic set is shown to be dependent on the generating set chosen, even for free groups. We also show that the class of groups whose geodesic sets are star-free with respect to some generating set is closed under taking graph (and hence free and direct) products, and includes all virtually abelian groups.

[1]  Ruth Charney,et al.  The language of geodesics for Garside groups , 2004 .

[2]  Joseph Loeffler,et al.  Graph Products and Cannon Pairs , 2002, Int. J. Algebra Comput..

[3]  Lucas Sabalka.  Geodesics in the braid group on three strands , 2003 .

[4]  Dominique Perrin,et al.  Finite Automata , 1958, Philosophy.

[5]  Walter D. Neumann,et al.  Automatic structures, rational growth, and geometrically finite hyperbolic groups , 1995 .

[6]  Raymond E. Miller,et al.  Varieties of Formal Languages , 1986 .

[7]  D UllmanJeffrey,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001 .

[8]  Achim Blumensath,et al.  Automatic structures , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[9]  R. McNaughton,et al.  Counter-Free Automata , 1971 .

[10]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[11]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[12]  Susan Hermiller,et al.  Algorithms and Geometry for Graph Products of Groups , 1995 .

[13]  É. Ghys,et al.  Sur Les Groupes Hyperboliques D'Apres Mikhael Gromov , 1990 .

[14]  D. L. Johnson.  Topics in the Theory of Group Presentations: Small cancellation groups , 1980 .

[15]  Howard Straubing.  Finite Automata, Formal Logic, and Circuit Complexity , 1994, Progress in Theoretical Computer Science.

[16]  Elisabeth Ruth Green,et al.  Graph products of groups , 1990 .

[17]  David B. A. Epstein,et al.  Word processing in groups , 1992 .