Computer Science – Formal Languages and Automata Theory
Scientific paper
2010-12-07
Computer Science
Formal Languages and Automata Theory
Chapter 23 of the handbook "AutoMathA". With index
Scientific paper
This text, Chapter 23 in the "AutoMathA" handbook, is devoted to the study of rational subsets of groups, with particular emphasis on the automata-theoretic approach to finitely generated subgroups of free groups. Indeed, Stallings' construction, associating a finite inverse automaton with every such subgroup, inaugurated a complete rewriting of free group algorithmics, with connections to other fields such as topology or dynamics. Another important vector in the chapter is the fundamental Benois' Theorem, characterizing rational subsets of free groups. The theorem and its consequences really explain why language theory can be successfully applied to the study of free groups. Rational subsets of (free) groups can play a major role in proving statements (a priori unrelated to the notion of rationality) by induction. The chapter also includes related results for more general classes of groups, such as virtually free groups or graph groups.
Bartholdi Laurent
Silva Pedro V.
No associations
LandOfFree
Rational subsets of groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Rational subsets of groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rational subsets of groups will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-481109