Advertisement

Cybernetics and Systems Analysis

, Volume 42, Issue 2, pp 265–276 | Cite as

A software system for growth analysis of mealy automata

  • I. I. Reznikov
  • V. I. Sushchanskii
Article
  • 24 Downloads

Abstract

A software system for the growth analysis of Mealy automata during iterations is discussed. The mathematical basis of the system is described. The main difficulties arising during the analysis are studied. The structure and software implementation of the system are described.

Keywords

Mealy automaton growth function software system component programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. I. Grigorchuk, “On semigroups with reductions in power growth,” Mat. Zametki, 43, No. 3, 305–319 (1988).MATHMathSciNetGoogle Scholar
  2. 2.
    F. Gécseg, Products of Automata, Springer-Verlag, Berlin etc. (1986).MATHGoogle Scholar
  3. 3.
    S. V. Alyoshin, “Finite automata and the Burnside problem on periodic groups,” Mat. Zametki, 11, No. 3, 319–328 (1972).MathSciNetGoogle Scholar
  4. 4.
    R. Grigorchuk and A. Zuk, “The lamplighter group as a group generated by a 2-state automaton, and its spectrum,” Geometriae Dedicata, 87, No. 1–3, 209–244 (2001).MATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    I. I. Reznikov and V. I. Sushchanskii, “Mealy automata of intermediate growth with two states over a two-letter alphabet,” Mat. Zametki, 72, No. 1, 102–117 (2002).MATHMathSciNetGoogle Scholar
  6. 6.
    V. M. Glushkov, “An abstract theory of automata,” UMN, 16, No. 5, 3–62 (1961).Google Scholar
  7. 7.
    V. B. Kudryavtsev, S. V. Alyoshin, and A. S. Podkolzin, Elements of the Theory of Automata [in Russian], Izd. MGU, Moscow (1978).Google Scholar
  8. 8.
    G. Birkhoff and T. C. Bartee, Modern Applied Algebra, McGraw-Hill, New York (1970).MATHGoogle Scholar
  9. 9.
    I. I. Reznikov, “Mealy automata with two states over a two-element alphabet that generate a free semigroup,” Visn. Kyiv. Univ., Ser. Fiz.-Mat. Nauk, No. 3, 58–65 (2001).Google Scholar
  10. 10.
    R. I. Grigorchuk, V. V. Nekrashevich, and V. I. Sushchanskii, “Automata, dynamic systems, and groups,” Tr. Mat. In-ta im. V. A. Steklova, 231, 134–214 (2000).MATHMathSciNetGoogle Scholar
  11. 11.
    I. Reznykov, “On 2-state Mealy automata of polynomial growth,” Algebra and Discrete Mathematics, No. 4, 66–85 (2003).Google Scholar
  12. 12.
    J. Hopcroft, “An n log n algorithm for minimizing states in a finite automaton,” Th. Mach. Comput., Proc. Int. Symp., Haifa (1971), pp. 189–196.Google Scholar
  13. 13.
    D. Gries, “Describing an algorithm by Hopcroft,” Acta Informatica, 2, 97–109 (1973).MATHMathSciNetCrossRefGoogle Scholar
  14. 14.
    L. Bartholdi, I. Reznykov, and V. Sushchanskii, “The smallest Mealy automaton of intermediate growth,” J. Algebra, 295, Issue 2, 387–414 (2006).MATHMathSciNetGoogle Scholar
  15. 15.
    G. Hardy and S. Ramanujan, “Asymptotic formulae in combinatory analysis,” Proc. London Math. Soc., 17, No. 2, 75–115 (1918).Google Scholar
  16. 16.
    G. E. Andrews, The Theory of Partitions, Addison-Wesley Publ. Co., London-Amsterdam-Sydney-Tokio (1976).Google Scholar
  17. 17.
    I. Reznykov, “On composite and non-monotonic growth functions of Mealy automata,” Math. Studii, 22, No. 2, 202–214 (2004).MATHMathSciNetGoogle Scholar
  18. 18.
    The GAP Group. GAP — Groups, Algorithms, and Programming, Version 4.2, Aachen, St. Andrews (1999) (http://www.gap-system.org/).Google Scholar
  19. 19.
    J. J. Cannon and C. Playoust, “An introduction to algebraic programming in Magma,” in: School of Math. and Stat., Sydney, Univ of Sydney (1996) (http://magma.maths.usyd.edu.au/).Google Scholar
  20. 20.
    I. I. Reznikov and V. I. Sushchanskii, “Growth functions of automata with two states over a two-element alphabet,” Dop. NAN Ukrainy, No. 2, 76–81 (2002).Google Scholar
  21. 21.
    D. A. Pospelov, Logic-Linguistic Models in Control Systems [in Russian], Energoatomizdat, Moscow (1981).Google Scholar
  22. 22.
    C. J. Date, An Introduction to Database Systems, Addison-Wesley, New York (1995).Google Scholar
  23. 23.
    Microsoft Windows DNA 2000 — The Platform for Building the Business Internet, A Microsoft Corp. White Paper, Dec. 1 (1999) (http://www.microsoft.com/technet/archive/itsolutions/intranet/build/dna2k.mspx).Google Scholar

Copyright information

© Springer Science+Business Media, Inc. 2006

Authors and Affiliations

  • I. I. Reznikov
    • 1
  • V. I. Sushchanskii
    • 2
  1. 1.Iks5 Ltd.KievUkraine
  2. 2.T. Shevchenko National UniversityKievUkraine

Personalised recommendations