Automatic presentations for finitely generated groups.
From MaRDI portal
Recommendations
Cited in
(23)- Automaton semigroups
- Automatic presentations for semigroups.
- Learning pattern languages over groups
- The computable dimension of ordered abelian groups
- Automatic presentations and semigroup constructions
- Finitely generated groups are universal among finitely generated structures
- Finitely generated structures computable in polynomial time
- Lamplighter groups and automata
- Automatically presented groups.
- Cayley automatic groups and numerical characteristics of Turing transducers
- Learning pattern languages over groups
- Where automatic structures benefit from weighted automata
- Unary Automatic Graphs: An Algorithmic Perspective
- Describing Groups
- Automatic Presentations for Cancellative Semigroups
- Subalgebras of FA-presentable algebras.
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- Tree-automatic well-founded trees
- Word automatic groups of nilpotency class 2
- Finite automata presentable Abelian groups
- Simple classes of automatic structures
- Word structures and their automatic presentations
- FA-presentable groups and rings
This page was built for publication: Automatic presentations for finitely generated groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710719)