AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK Academic Article uri icon

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.

published proceedings

  • INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION

author list (cited authors)

  • Steinberg, B., Vorobets, M., & Vorobets, Y.

citation count

  • 21

complete list of authors

  • Steinberg, Benjamin||Vorobets, Mariya||Vorobets, Yaroslav

publication date

  • February 2011