Name
Abstract | ||
|---|---|---|
We study automata groups generated by reset automata. Every lamplighter group Z/nZ wr Z can be generated by such an automaton, and in general these automata groups are similar in nature to lamplighters: they are amenable locally-finite-by-cyclic groups; under mild decidable conditions, the semigroups generated by such automata are free. Parabolic subgroups and fractal properties are considered. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1142/S0218196705002761 | INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION |
Keywords | Field | DocType |
automata groups, Cayley machines, reset automata, free semigroups, lamplighter groups | Quantum finite automata,Discrete mathematics,Krohn–Rhodes theory,Algebra,Generalization,Fractal,Automaton,Decidability,Mathematics,Lamplighter group,Parabola | Journal |
Volume | Issue | ISSN |
15 | 5-6 | 0218-1967 |
Citations | PageRank | References |
19 | 3.56 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pedro V. Silva | 1 | 141 | 29.42 |
| Benjamin Steinberg | 2 | 102 | 17.57 |