Automatic quotients of free groups.
From MaRDI portal
Abstract: Automatic groups admitting prefix closed automatic structures with uniqueness are characterized as the quotients of free groups by normal subgroups possessing sets of free generators satisfying certain language-theoretic conditions.
Recommendations
- scientific article; zbMATH DE number 1944116
- scientific article; zbMATH DE number 665465
- The use of Knuth-Bendix methods to solve the word problem in automatic groups
- A NOTE ON THE GRAMMAR OF COMBINGS
- scientific article; zbMATH DE number 2101006
- Automata groups.
- Automatic Groups Associated with Word Orders Other than Shortlex
- Groups defined by automata
- Groups generated by automata.
- Groups and automata: a perfect match
Cites work
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- scientific article; zbMATH DE number 1944116 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 2221698 (Why is no real title available?)
- DETERMINISTIC AND NON-DETERMINISTIC ASYNCHRONOUS AUTOMATIC STRUCTURES
- Discrete groups. Transl. from the Japanese by Ken'ichi Ohshika
- Geometric group theory
- Synchronized rational relations of finite and infinite words
Cited in
(7)- Algorithms and topology of Cayley graphs for groups.
- Homophonic quotients of linguistic free groups: German, Korean, and Turkish
- Finite quotients of the automorphism group of a free group
- Automatic subsemigroups of free products.
- Quotients Homophones des Groupes Libres Homophonic Quotients of Free Groups
- AUTOMORPHISM GROUPS OF QUANDLES
- TWO AUTOMATIC SPANNING TREES IN SMALL CANCELLATION GROUP PRESENTATIONS
This page was built for publication: Automatic quotients of free groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2570182)