The Complexity of Verbal Languages over Groups

This paper investigates the complexity of verbal languages and pattern languages of Thurston automatic groups in terms of the Chomsky hierarchy. Here the language generated by a pattern is taken as the set of representatives of all strings obtained when chosing values for the various variables. For noncommutative free groups, it is shown that the complexity of the verbal and pattern languages (in terms of level on the Chomsky hierarchy) does not depend on the Thurston automatic representation and that verbal languages cannot be context-free (unless they are either the empty word or the full group). They can however be indexed languages. Furthermore, it is shown that in the general case, it might depend on the exactly chosen Thurston automatic representation which level a verbal language takes in the Chomsky hierarchy. There are examples of groups where, in an appropriate representation, all pattern languages are regular or context-free, respectively.

[1]  Alexei G. Myasnikov,et al.  Definable Sets in a hyperbolic Group , 2011, Int. J. Algebra Comput..

[2]  Alexei G. Myasnikov,et al.  On Rationality of Verbal Subsets in a Group , 2011, Theory of Computing Systems.

[3]  N. Nikolov.  Algebraic properties of profinite groups , 2011, 1108.5130.

[4]  Alexei G. Myasnikov,et al.  From automatic structures to automatic groups , 2011, ArXiv.

[5]  Sanjay Jain,et al.  Regular patterns, regular languages and context-free languages , 2010, Inf. Process. Lett..

[6]  Daniel Reidenbach.  The ambiguity of morphisms in free monoids and its impact on algorithmic properties of pattern languages , 2006, Ausgezeichnete Informatikdissertationen.

[7]  A. Myasnikov,et al.  Elementary theory of free non-abelian groups , 2006 .

[8]  Daniel Reidenbach,et al.  A non-learnable class of E-pattern languages , 2006, Theor. Comput. Sci..

[9]  Grzegorz Rozenberg,et al.  Extension of tabled 0L-systems and languages , 1973, International Journal of Computer & Information Sciences.

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

[11]  Robert H. Gilman,et al.  Geometric and Computational Perspectives on Infinite Groups , 1995 .

[12]  R. Gilman.  Formal languages and infinite groups , 1995, Geometric and Computational Perspectives on Infinite Groups.

[13]  Anil Nerode,et al.  Automatic Presentations of Structures , 1994, LCC.

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

[15]  J. L. Britton.  Review: G. S. Makanin, Equations in a Free Group , 1986 .

[16]  G. Makanin.  DECIDABILITY OF THE UNIVERSAL AND POSITIVE THEORIES OF A FREE GROUP , 1985 .

[17]  G. Makanin.  EQUATIONS IN A FREE GROUP , 1983 .

[18]  Dana Angluin,et al.  Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..

[19]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[20]  G. Makanin.  The Problem of Solvability of Equations in a Free Semigroup , 1977 .

[21]  Andrzej Ehrenfeucht,et al.  On Some Context Free Languages That Are Not Deterministic ETOL Languages , 1977, RAIRO Theor. Informatics Appl..

[22]  Sven Skyum,et al.  A Relationship between ET0L and EDT0L Languages , 1976, Theor. Comput. Sci..

[23]  Alfred V. Aho,et al.  Indexed Grammars—An Extension of Context-Free Grammars , 1967, SWAT.