Groups and NTS Languages

Abstract The context-free groups are known to be exactly the finitely generated virtually free groups [19, 11]. We give here a new combinatorial property which characterizes these groups: they are “locally primary.” A corollary of this property is that the cylinder generated by the group languages is included in the family of NTS languages. In particular, every context-free group language is NTS.

[1]  Robert H. Gilman.  Computations with Rational Subsets of Confluent Groups , 1984, EUROSAM.

[2]  Friedrich Otto,et al.  Groups presented by finite two-monadic Church-Rosser Thue systems , 1986 .

[3]  Robert Henry Haring-Smith.  Groups and simple languages , 1983 .

[4]  M. J. Dunwoody.  The accessibility of finitely presented groups , 1985 .

[5]  R. Gregorac.  On Generalized Free Products of Finite Extensions of Free Groups , 1966 .

[6]  Michael A. Arbib,et al.  An Introduction to Formal Language Theory , 1988, Texts and Monographs in Computer Science.

[7]  Volker Diekert.  Some Remarks on Presentations by Finite Church-Rosser Thue Systems , 1987, STACS.

[8]  Ronald V. Book,et al.  On Expressing Commutativity by Finite Church-Rosser Presentations: A Note on Commutative Monoids , 1984, RAIRO Theor. Informatics Appl..

[9]  A. Karrass,et al.  Finite and infinite cyclic extensions of free groups , 1973, Journal of the Australian Mathematical Society.

[10]  Luc Boasson,et al.  Langages de Parenthèses, Langages N.T.S. et Homomorphismes Inverses , 1984, RAIRO Theor. Informatics Appl..

[11]  Y. Cochet,et al.  Une Generalisation des Ensembles de Dyck , 1971 .

[12]  Matthias Jantzen,et al.  Thue Systems and the Church-Rosser Property , 1984, MFCS.

[13]  Ronald V. Book,et al.  Thue Systems as Rewriting Systems , 1985, J. Symb. Comput..

[14]  David E. Muller,et al.  Groups, the Theory of Ends, and Context-Free Languages , 1983, J. Comput. Syst. Sci..

[15]  Luc Boasson,et al.  NTS Languages Are Deterministic and Congruential , 1985, J. Comput. Syst. Sci..