Automata over a binary alphabet generating free groups of even rank

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We 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.

Keywords

Group Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/117776

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0610033
 http://arxiv.org/abs/math/0610033

Collections

arXiv