Recommendations
Cited in
(42)- Central limit theorems for counting measures in coarse negative curvature
- Groups, languages and dendric shifts
- Language classes associated with automata over matrix groups
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- Groups defined by automata
- Coxeter systems for which the Brink-Howlett automaton is minimal
- Biautomatic structures in systolic Artin groups
- Curvature distribution and hyperbolicity
- Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems
- Polynomial-time proofs that groups are hyperbolic
- scientific article; zbMATH DE number 848082 (Why is no real title available?)
- Commutative semigroups with a context-free word problem
- The Development of the Theory of Automatic Groups
- Groups and automata: a perfect match
- Automatic structures and groups
- Automata groups.
- Automaticity for graphs of groups
- Representations of group automata
- Effective equation solving, constraints, and growth in virtually abelian groups
- The complexity of knapsack problems in wreath products
- Complexity and randomness in group theory. GAGTA book 1
- Exercises in Cellular Automata and Groups
- Fibonacci groups F(2,n) are hyperbolic for n odd and n 11
- Counting problems in graph products and relatively hyperbolic groups
- Streaming in graph products
- Post's Correspondence Problem for hyperbolic and virtually nilpotent groups
- Languages and automata. GAGTA book 3
- On endomorphisms of automatic groups
- scientific article; zbMATH DE number 3887910 (Why is no real title available?)
- On lexicographic representatives in braid monoids
- EDT0L solutions to equations in group extensions
- Formal Languages and Groups as Memory
- scientific article; zbMATH DE number 7559146 (Why is no real title available?)
- scientific article; zbMATH DE number 7561757 (Why is no real title available?)
- Rational sets in virtually abelian groups: languages and growth
- Word problems of groups: formal languages, characterizations and decidability
- Groups and automata: a perfect match
- Free products of semigroups and monoids with a deterministic context-free word problem
- Groups generated by automata.
- Quaternionic lattices and the poly-context-free word problem
- Garside combinatorics for Thompson's monoid \(F^+\) and a hybrid with the braid monoid \(B_{\infty }^{+}\)
- The word problem and growth of groups
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)
