Groups and automata: a perfect match

Authors:
Pedro V. Silva
Affiliations:
Centro de Matemática, Faculdade de Ciências, Universidade do Porto, Porto, Portugal
Venue:
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Year:
2012

Citing 5
Cited 0

Some decision problems about controlled rewriting systems

Theoretical Computer Science
String-rewriting systems

String-rewriting systems
Word Processing in Groups

Word Processing in Groups
Algorithms in geometric group theory

Algorithms in geometric group theory
Rational subsets of partially reversible monoids

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a personal perspective, inspired by our own research experience, of the interaction between group theory and automata theory: from Benois' Theorem to Stallings' automata, from hyperbolic to automatic groups, not forgetting the exotic automaton groups.