From the Publisher:
Although it originated as a method to study general dynamical systems, symbolic dynamics is useful in coding for data storage and transmission as well as in linear algebra. Requiring only a undergraduate knowledge of linear algebra, this first general textbook includes over 500 exercises.

An Introduction to Symbolic Dynamics and Coding

Combinatorial Group Theory: COMBINATORIAL GROUP THEORY

General introduction to the special odd case General lemmas Theorem $C^*_2$: Stage 1 Theorem $C^*_2$: Stage 2 Theorem $C_2$: Stage 3 Theorem $C_2$: Stage 4 Theorem $C_2$: Stage 5 Theorem $C_3$: Stage 1 Theorem $C_3$: Stages 2 and 3 IV$_K$: Preliminary properties of $K$-groups Background references Expository references Glossary Index.

http://inis.jinr.ru/sl/M_Mathematics/MA_Algebra/MAtg_Group%20theory/Gorenstein%20D.,%20Lyons%20R.,%20Solomon%20R.%20Classification%20of%20finite%20simple%20groups%201%20(AMS%20survey%2040%20no.1,%201994,%202000)(176s).pdf

The Classification of the Finite Simple Groups

In this chapter we introduce the string-rewriting systems and study their basic properties. Such systems are the primary subject of this work. We provide formal definitions of string-rewriting systems and their induced reduction relations and Thue congruences. Some of the basic ideas that occur in the study of term-rewriting systems are considered. We rely on Section 1.4 for basic definitions and notation for strings, and we rely on Section 1.1 for basic definitions and results on notions such as reduction, confluence, the Church-Rosser property, and so forth.

String-rewriting systems

We summarize properties of 3-manifold groups, with a particular focus on the consequences of the recent results of Ian Agol, Jeremy Kahn, Vladimir Markovic and Dani Wise.

3-Manifold Groups

This paper discusses a division of one-dimensional cellular automata into classes which seem to correspond to different types of behaviour.

/pdf/classes-of-linear-automata-3jlk60uite.pdf

Classes of linear automata

Presentations of groups and monoids

Let G and F be groups. A G-defining subgroup of F is a normal subgroup N of F such that F/N is isomorphic to G. The automorphism group Aut (F) acts on the set of G-defining subgroups of F. If G is finite and F is finitely generated, one obtains a finite permutation representation of Out (F), the outer automorphism group of F. We study these representations in the case that F is a free group.

Finite Quotients of the Automorphism Group of a Free Group

Geometric and Computational Perspectives on Infinite Groups

A language-theoretic definition of word hyperbolic semigroup is given, which coincides with the original definition for a group. Word problems of semigroups are also considered.

Robert H. Gilman

Papers

Classes of linear automata

Presentations of groups and monoids

Finite Quotients of the Automorphism Group of a Free Group

Geometric and Computational Perspectives on Infinite Groups

Word hyperbolic semigroups