The following pages link to Automata and square complexes. (Q2487750):
Displaying 36 items.
- Automaton semigroups: the two-state case. (Q290910) (← links)
- Free subgroups in groups acting on rooted trees (Q531921) (← links)
- Some topics in the dynamics of group actions on rooted trees. (Q641942) (← links)
- The concept of duality for automata over a changing alphabet and generation of a free group by such automata (Q653339) (← links)
- Automata generating free products of groups of order 2. (Q657941) (← links)
- Lifts, derandomization, and diameters of Schreier graphs of Mealy automata (Q681602) (← links)
- Lamplighter groups, bireversible automata, and rational series over finite rings (Q784896) (← links)
- On the structure theory of partial automaton semigroups (Q786010) (← links)
- Orbit automata as a new tool to attack the order problem in automaton groups (Q891470) (← links)
- On a series of finite automata defining free transformation groups. (Q965093) (← links)
- Automaton semigroups (Q1034622) (← links)
- On level-transitivity and exponential growth (Q1702514) (← links)
- Arithmetic aspects of self-similar groups. (Q1932134) (← links)
- Automaton groups and complete square complexes (Q2141714) (← links)
- Infinite automaton semigroups and groups have infinite orbits (Q2306651) (← links)
- Self-similar groups and the zig-zag and replacement products of graphs (Q2343502) (← links)
- Virtual endomorphisms of nilpotent groups. (Q2372587) (← links)
- On groups generated by bi-reversible automata: the two-state case over a changing alphabet (Q2396829) (← links)
- Square on deterministic, alternating, and Boolean finite automata (Q2401004) (← links)
- Complete square complexes. (Q2468432) (← links)
- The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet (Q2629849) (← links)
- Freeness of automaton groups vs boundary dynamics (Q2629888) (← links)
- On a free group of transformations defined by an automaton. (Q2642671) (← links)
- Groups generated by 3-state automata over a 2-letter alphabet. II. (Q2655979) (← links)
- The Lamplighter Group ℤ<sub>3</sub>≀ℤ Generated by a Bireversible Automaton (Q2827247) (← links)
- Centralizers in \(\tilde A_2\) groups (Q2882816) (← links)
- Implementing Computations in Automaton (Semi)groups (Q2914713) (← links)
- AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK (Q2996850) (← links)
- Automaton (Semi)groups: Wang Tilings and Schreier Tries (Q4613554) (← links)
- Combinatorial models of expanding dynamical systems (Q5166519) (← links)
- Square on Deterministic, Alternating, and Boolean Finite Automata (Q5205045) (← links)
- Boundary dynamics for bireversible and for contracting automaton groups (Q5221286) (← links)
- Infinite series of quaternionic 1-vertex cube complexes, the doubling construction, and explicit cubical Ramanujan complexes (Q5237443) (← links)
- The lamplighter group of rank two generated by a bireversible automaton (Q5384655) (← links)
- Bireversible automata generating lamplighter groups (Q6096764) (← links)
- On reversible automata generating lamplighter groups (Q6632100) (← links)
