Automata over a binary alphabet generating free groups of even rank

Simple item page
dc.creatorSteinberg, Benjamin
dc.creatorVorobets, Mariya
dc.creatorVorobets, Yaroslav
dc.date2006-10-01
dc.date.accessioned2026-07-07T07:28:34Z
dc.date.available2026-07-07T07:28:34Z
dc.descriptionWe construct automata over a binary alphabet with $2n$ states, $n\geq 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.
dc.identifierhttps://arxiv.org/abs/math/0610033
dc.identifierhttp://arxiv.org/abs/math/0610033
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/117776
dc.subjectGroup Theory
dc.titleAutomata over a binary alphabet generating free groups of even rank
dc.typetext

Files

Collections

arXiv