Groups, the Theory of Ends, and Context-Free Languages

@article{Muller1983GroupsTT,
  title={Groups, the Theory of Ends, and Context-Free Languages},
  author={David E. Muller and Paul E. Schupp},
  journal={J. Comput. Syst. Sci.},
  year={1983},
  volume={26},
  pages={295-310}
}

Figures from this paper

Automatic Groups and String Rewriting

This article considers automatic groups from the point of view of automata and language theory, and sees how work of Epstein, Holt and Rees puts automatic groups naturally into the context of string rewriting.

Descriptions of groups using formal language theory

The main contribution is the fact that a group for which all irreducible word problems are recursively enumerable must necessarily have solvable word problem.

The Theory of Ends, Pushdown Automata, and Second-Order Logic

Groups and simple languages

With any finitely generated group presentation, one can associate a formal language (called the reduced word problem) consisting of those words on the generators and their inverses which are equal to

Groups, formal language theory and decidability

The first four chapters provide an introduction, background information and a summary of results from some of the relevant literature, and some characterisations of monoids based on properties that the full preimage of certain subsets satisfy when considered as a formal language over the generating set are proved.

Context-Free Languages

  • J. BerstelL. Boasson
  • Computer Science
    Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990

Extended Finite Automata and Word Problems

  • J. Corson
  • Mathematics, Computer Science
    Int. J. Algebra Comput.
  • 2005
It is shown that the family of languages accepted by extended finite automata over a monoid K is controlled by the word problem of K in a precisely stated manner and it is deduced that along with the free group of rank two, the only finitely generated groups with this property are precisely the groups that have a nonabelian free subgroup of finite index.

Formal Languages and the Word Problem for Groups

The aim of this article is to survey some connections between formal language theory and group theory with particular emphasis on the word problem for groups and the consequence on the algebraic

Decidable Theories of Cayley-Graphs

It is proved that a connected graph of bounded degree with only finitely many orbits has a decidable MSO-theory if and only if it is context-free, and a new unfolding construction is introduced, the factorized unfolding, that generalizes the tree-like structures considered by Walukiewicz.

On a class of poly-context-free groups generated by automata

. This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the
...

References

SHOWING 1-10 OF 12 REFERENCES

Pushdown automata, graphs, ends, second-order logic, and reachability problems

It is shown that the monadic second-order theory of any context-free graph is decidable, and using the results obtained and Rabin's theorem, this work shows that cellular automata and vector addition systems make sense on a very general class of graphs.

Groups and simple languages

With any finitely generated group presentation, one can associate a formal language (called the reduced word problem) consisting of those words on the generators and their inverses which are equal to

Groups of Cohomological Dimension One

Cohomology theory.- Ends.- The structure theorem.- The augmentation ideal.- The finitely generated case.- The countable case.- Splitting theorems.- The main theorems.

Finite and infinite cyclic extensions of free groups

Using Stalling's characterization [11] of finitely generated (f. g.) groups with infinitely many ends, and subgroup theorems for generalized free products and HNN groups (see [9], [5], and [7]), we

Introduction to formal language theory

The theory of formal languages has been developed extensively, and has several discernible trends, which include applications to the syntactic analysis of programming languages, program schemes, models of biological systems, and relationships with natural languages.