z-logo
Premium
Finiteness Conditions on Subgroups and Formal Language Theory
Author(s) -
Frougny Christiane,
Sakarovitch Jacques,
Schupp Paul
Publication year - 1989
Publication title -
proceedings of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.899
H-Index - 65
eISSN - 1460-244X
pISSN - 0024-6115
DOI - 10.1112/plms/s3-58.1.74
Subject(s) - mathematics , pure mathematics , formal group , linguistics , philosophy
We show in this article that the most usual finiteness conditions on a subgroup of a finitely generated group all have equivalent formulations in terms of formal language theory. This correspondence gives simple proofs of various theorems concerning intersections of subgroups and the preservation of finiteness conditions in a uniform manner. We then establish easily the theorems of Greibach and of Griffiths by considering free reductions of languages that describe the computations of pushdown automata in one case and of Turing machines in the other, thus making clear that they are essentially the same.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here