The characterization by automata of certain profinite groups

• Adam Woryna ^[1]
  1. [1] Silesian University of Technology

     Silesian University of Technology

     Gliwice, Polonia

     
• Localización: Journal of pure and applied algebra, ISSN 0022-4049, Vol. 219, Nº 5 ( (May 2015)), 2015, págs. 1564-1591
• Idioma: inglés
• DOI: 10.1016/j.jpaa.2014.06.016
• Enlaces
  • Texto completo
• Resumen

  • We use the combinatorial language of automata to define and study profinite groups which are infinitely iterated permutational wreath products of transitive finite permutation groups. We provide some naturally defined automaton realizations of these groups by the so-called time-varying automata, as well as by Mealy automata to characterize these groups as automaton groups, i.e. as groups topologically generated by a single automaton