Name
Abstract | ||
|---|---|---|
We construct automata over a binary alphabet with 2n states, n >= 2, whose states freely generate a free group of rank 2n. Combined with previous work, this shows that a free group of every finite rank can be generated by finite automata over a binary alphabet. We also construct free products of cyclic groups of order two via such automata. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1142/S0218196711006194 | INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION |
Keywords | Field | DocType |
Free groups, automaton groups, self-similar groups, bireversible automata | Discrete mathematics,Quantum finite automata,Free product,Combinatorics,Nondeterministic finite automaton,Algebra,Cyclic group,Automaton,Finite-state machine,Mathematics,Free group,Binary number | Journal |
Volume | Issue | ISSN |
21 | 1-2 | 0218-1967 |
Citations | PageRank | References |
11 | 1.39 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benjamin Steinberg | 1 | 43 | 6.04 |
| Mariya Vorobets | 2 | 11 | 1.39 |
| Yaroslav Vorobets | 3 | 11 | 1.72 |