Bireversible automata generating lamplighter groups
From MaRDI portal
Publication:6096764
Recommendations
- The lamplighter group \(\mathbb Z_3 \wr \mathbb Z\) generated by a bireversible automaton
- The lamplighter group of rank two generated by a bireversible automaton
- ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
- On groups generated by bi-reversible automata: the two-state case over a changing alphabet
- Lamplighter groups and automata
Cites work
- Automata and square complexes.
- Automata over a binary alphabet generating free groups of even rank.
- Commensurators of groups and reversible automata
- Complexity of finite semigroups
- Lamplighter groups, bireversible automata, and rational series over finite rings
- ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
- On a series of finite automata defining free transformation groups.
- On the Burnside problem for periodic groups
- On the existence of free subsemigroups in reversible automata semigroups
- The lamplighter group \(\mathbb Z_3 \wr \mathbb Z\) generated by a bireversible automaton
- The spectra of lamplighter groups and Cayley machines.
- To infinity and beyond
Cited in
(8)- Lamplighter groups and automata
- Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups
- Cross-wired lamplighter groups and linearity of automata groups
- On reversible automata generating lamplighter groups
- The lamplighter group of rank two generated by a bireversible automaton
- The lamplighter group \(\mathbb Z_3 \wr \mathbb Z\) generated by a bireversible automaton
- Lamplighter groups, bireversible automata, and rational series over finite rings
- ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
This page was built for publication: Bireversible automata generating lamplighter groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6096764)