Formal Languages and Infinite Groups

Abstract

This article is an introduction to formal languages from the point of view of combinatorial group theory. Group theoretic applications are included and language classes are defined algebraically.

DVI file, 25 pages. To appear in "Geometric and Computational Perspectives on Infinite Groups"

Cited by in corpus (6)

• On groups and counter automata
• On groups whose word problem is solved by a nested stack automaton
• On Rationality of Verbal Subsets In a Group
• Cone types and geodesic languages for lamplighter groups and Thompson's group F
• Bounded Automata Groups are co-ET0L
• Pattern avoiding permutations are context-sensitive