95
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

The Automaton Realization of Iterated Wreath Products of Cyclic Groups

Pages 1354-1361 | Received 10 May 2012, Published online: 20 Nov 2013

REFERENCES

  • Bartholdi , L. ( 2003 ). A Wilson group of non-uniformly exponential growth . C. R., Math., Acad. Sci. Paris 336 ( 7 ): 549 – 554 .
  • Bondarenko , I. V. ( 2010 ). Finite generation of iterated wreath products . Arch. Math. 95 : 301 – 308 .
  • Grigorchuk , R. ( 2005 ). Solved and unsolved problems around one group . In: Infinite Groups: Geometric, Combinatorial and Dynamical Aspects . Vol. 248 . Basel : Progr. Math., Birkhuser , pp. 117 – 218 .
  • Lucchini , A. ( 2004 ). A 2-generated just-infinite profinite group which is not positively generated . Israel J. Math. 141 : 119 – 123 .
  • Mikolajczak , B. ( 1991 ). Algebraic and structural automata theory, translated from the Polish Annals of Discrete Mathematics . Vol. 44 . Amsterdam : North-Holland Publishing Co .
  • Nekrashevych , V. ( 2005 ). Self-similar Groups . Vol. 117 . Am. Math. Soc. , Providence , RI : Math. Surv. Monogr .
  • Neumann , P. ( 1986 ). Some questions of Edjvet and Pride about infinite groups . Ill. J. Math. 30 : 301 – 316 .
  • Segal , D. ( 2001 ). The finite images of finitely generated groups . Proc. Lond. Math. Soc., III. Ser. 82 ( 3 ): 597 – 613 .
  • Woryna , A. ( 2005 ). On permutation groups generated by time-varying Mealy automata . Publ. Math. Debrecen 67 ( 1–2 ): 115 – 130 .
  • Woryna , A. ( 2006 ). On generation of wreath products of cyclic groups by two state time varying Mealy automata . Internat. J. Algebra Comput. 16 ( 2 ): 397 – 415 .
  • Woryna , A. ( 2008 ). The generalized dihedral groups Dih(ℤ n ) as groups generated by time-varying automata . Algebra Discrete Math. ( 3 ): 98 – 111 .
  • Woryna , A. ( 2011 ). The rank and generating set for iterated wreath products of cyclic groups . Communications in Algebra 39 : 2622 – 2631 .
  • Woryna , A. ( 2011 ). The concept of duality for automata over a changing alphabet and generation of a free group by such automata . Theoretical Computer Science 412 : 6420 – 6431 .
  • Communicated by S. Hermiller.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.