Language classes associated with automata over matrix groups

We investigate the language classes recognized by group automata over matrix groups. We present a summary of the results obtained so far together with a number of new results. We look at the computational power of time-bounded group automata where the group under consideration has polynomial growth.

[1]  Sean Cleary,et al.  The word problem distinguishes counter languages , 2006 .

[2]  Jon M. Corson.  Extended Finite Automata and Word Problems , 2005, Int. J. Algebra Comput..

[3]  La Harpe,et al.  Topics in Geometric Group Theory , 2000 .

[4]  Paul M. Weichsel,et al.  A first course in abstract algebra , 1966 .

[5]  Jeffrey Shallit,et al.  Automaticity III: Polynomial automaticity and context-free languages , 1998, computational complexity.

[6]  Mark Kambites,et al.  On Groups and Counter Automata , 2008, Int. J. Algebra Comput..

[7]  Gillian Z. Elston,et al.  On groups whose word problem is solved by a~counter automaton , 2004, Theor. Comput. Sci..

[8]  Gilbert Baumslag,et al.  Subgroups of Direct Products of Free Groups , 1984 .

[9]  Victor Mitrana,et al.  Extended finite automata over groups , 2001, Discret. Appl. Math..

[10]  Elaine Render,et al.  Rational Monoid and Semigroup Automata , 2010 .

[11]  Mark Kambites,et al.  Formal Languages and Groups as Memory , 2006, math/0601061.

[12]  M. I. Kargapolov,et al.  Fundamentals of the theory of groups , 1979 .

[13]  Georg Zetzsche.  Silent Transitions in Automata with Storage , 2013, ICALP.

[14]  J. Rotman.  A First Course in Abstract Algebra , 1995 .

[15]  Victor Mitrana,et al.  Finite Automata over Free Groups , 2000, Int. J. Algebra Comput..

[16]  Arnold L. Rosenberg,et al.  Real Time Counter Machines (Preliminary Version) , 1967, SWAT.

[17]  Stanislav Zák,et al.  A Turing Machine Time Hierarchy , 1983, Theor. Comput. Sci..

[18]  Victor Mitrana,et al.  The Accepting Power of Finite Automata over Groups , 1997, New Trends in Formal Languages.

[19]  Oscar H. Ibarra,et al.  Finite Automata with Multiplication , 1976, Theor. Comput. Sci..

[20]  R. Lyndon,et al.  Combinatorial Group Theory , 1977 .

[21]  Sheila A. Greibach.  Remarks on Blind and Partially Blind One-Way Multicounter Machines , 1978, Theor. Comput. Sci..

[22]  Nathanial P. Brown Narutaka Ozawa.  C*-Algebras and Finite-Dimensional Approximations , 2008 .

[23]  Mark Kambites.  Word problems recognisable by deterministic blind monoid automata , 2006, Theor. Comput. Sci..