Skip to main content
Log in

On free semigroups of automaton transformations

  • Published:
Mathematical Notes Aims and scope Submit manuscript

Abstract

It is established that the subset of freek-generated subsemigroups of the semigroup of all automaton transformations over a finite alphabet is a second category set (in the sense of the Baire category approach) in the set of allk-generated subsemigroups. A continuum series of pairs of automaton transformations each of which generates a free semigroup of rank two is indicated. A criterion is established for this semigroup to be a finite-automaton group.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. V. A. Ufnarovskii, “Combinatorial and asymptotic methods in algebra,” in:Contemporary Problems in Mathematics. Fundamental Directions [in Russian], Vol. 57, Itogi Nauki i Tekhniki, VINITI, Moscow (1990), pp. 5–177.

    Google Scholar 

  2. V. P. Zarovnyi, “Automaton substitutions and interlacements of groups,”Dokl. Akad. Nauk SSSR [Soviet Math. Dokl.],160, No. 3, 562–565 (1965).

    MathSciNet  Google Scholar 

  3. L. A. Kaloujnine, P. M. Beleckij, and V. Z. Fejnberg,Kranzprodukte, Teubner, Leipzig (1987).

    Google Scholar 

  4. C. Wells, “Some applications of the wreath product construction,”Amer. Math. Monthly,83, 317–338 (1976).

    MATH  MathSciNet  Google Scholar 

  5. S. V. Aleshin, “Finite automata and the Burnside problem for periodic groups,”Mat. Zametki [Math. Notes],11, No. 3, 319–328 (1972).

    MATH  MathSciNet  Google Scholar 

  6. S. V. Aleshin, “A free group of finite automata,”Vestnik Moskov. Univ. Ser. I Mat. Mekh. [Moscow Univ. Math. Bull.], No. 4, 12–14 (1983).

    MATH  MathSciNet  Google Scholar 

  7. J. Tits, “Free subgroups in linear groups,”J. Algebra,20, 250–270 (1972).

    Article  MATH  MathSciNet  Google Scholar 

  8. D. B. A. Epstein, “Almost all subgroups of a Lie group are free,”J. Algebra,19, 261–262 (1971).

    Article  MATH  MathSciNet  Google Scholar 

  9. J. D. Dixon, “Most finitely generated permutation groups are free,”Bull. London Math. Soc.,22, 222–226 (1990).

    MATH  MathSciNet  Google Scholar 

  10. M. Bhattacharjee, “The ubiquity of free subgroups in certain inverse limits of groups,”J. Algebra,172, 134–146 (1995).

    Article  MATH  MathSciNet  Google Scholar 

  11. V. B. Kudryavtsev, S. V. Aleshin and A. S. Podkolzin,Introduction to Automata Theory [in Russian], Nauka, Moscow (1985).

    Google Scholar 

  12. W. C. Holland, “The characterization of generalized wreath product,”J. Algebra,13, 152–172 (1969).

    Article  MATH  MathSciNet  Google Scholar 

  13. R. A. Aleksandryan and É. A. Mirzakhanyan,General Topology [in Russian], Vysshaya Shkola, Moscow (1979).

    Google Scholar 

  14. J.-P. Serre,Cohomologie galoisienne, Springer-Verlag, Berlin-Heidelberg-New York (1964).

    Google Scholar 

  15. V. I. Sushchans'kii, “Standard subgroups of the isometry group of the metric space ofp-adic integers,”Visnik Kiïv. Univ. Ser. Mat. Mekh., No. 30, 100–107 (1988).

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Translated fromMatematicheskie Zametki, Vol. 63, No. 2, pp. 248–259, February, 1998.

The author wishes to express his deep gratitude to Professor V. I. Sushchans'kii for permanent help and attention to the research.

This research was partially supported by the ISSEP under grant No. GSU 051341.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Oliinyk, A.S. On free semigroups of automaton transformations. Math Notes 63, 215–224 (1998). https://doi.org/10.1007/BF02308761

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02308761

Key words

Navigation