Groups, languages and automata

DOI10.1017/9781316588246OpenAlexW2795748589MaRDI QIDQ2965530FDOQ2965530

Authors: Derek F. Holt, Sarah Rees, Claas E. Röver 

Publication date: 3 March 2017

Full work available at URL: https://doi.org/10.1017/9781316588246

Recommendations

• scientific article; zbMATH DE number 53661
• Groups generated by automata.
• Groups and automata: a perfect match
• Groups and automata: a perfect match
• Groups defined by automata

Mathematics Subject Classification ID

Geometric group theory (20F65) Algebraic theory of languages and automata (68Q70) Research exposition (monographs, survey articles) pertaining to group theory (20-02) Semigroups in automata theory, linguistics, etc. (20M35)

Cited In (32)

• Language classes associated with automata over matrix groups
• Groups, languages and dendric shifts
• Title not available (Why is that?)
• Groups defined by automata
• Biautomatic structures in systolic Artin groups
• Coxeter systems for which the Brink-Howlett automaton is minimal
• Curvature distribution and hyperbolicity
• Title not available (Why is that?)
• Polynomial-time proofs that groups are hyperbolic
• The Development of the Theory of Automatic Groups
• Groups and automata: a perfect match
• Automata groups.
• Automatic structures and groups
• Automaticity for graphs of groups
• Representations of group automata
• Complexity and randomness in group theory. GAGTA book 1
• Fibonacci groups \(F(2,n)\) are hyperbolic for \(n\) odd and \(n\geq 11\)
• Counting problems in graph products and relatively hyperbolic groups
• Post's Correspondence Problem for hyperbolic and virtually nilpotent groups
• On endomorphisms of automatic groups
• Title not available (Why is that?)
• On lexicographic representatives in braid monoids
• EDT0L solutions to equations in group extensions
• Formal Languages and Groups as Memory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Groups and automata: a perfect match
• Word problems of groups: formal languages, characterizations and decidability
• Free products of semigroups and monoids with a deterministic context-free word problem
• Groups generated by automata.
• Garside combinatorics for Thompson's monoid \(F^+\) and a hybrid with the braid monoid \(B_{\infty }^{+}\)
• Central limit theorems for counting measures in coarse negative curvature

This page was built for publication: Groups, languages and automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965530)