Finite-state automata in information technologies



A short review of applications of finite-state automata in some modern areas of computer science and technologies is presented. In particular, fields of application of finite-state automata in computer algebra, Petri nets, biology, and verification are considered.


finite-state automaton Buchi automaton Muller automaton verification 


  1. 1.
    V. M. Glushkov, “Abstract theory of automata,” Usp. Mat. Nauk, No. 5, 3–62 (1961).Google Scholar
  2. 2.
    V. M. Glushkov, A. A. Letichevskii, and A. B. Godlevskii, Synthesis Methods for Discrete Models [in Russian], Vyshcha Shkola, Kyiv (1983).Google Scholar
  3. 3.
    N. E. Kobrinskii and B. A. Trakhtenbrot, Introduction to the Theory of Finite Automata [in Russian], Fizmatgiz, Moscow (1962).Google Scholar
  4. 4.
    J. E. Hopcroft, J. Montwani, and J. D. Ullman, Introduction to Automata Theory and Computation, Addison Wesley, Stanford (2001).MATHGoogle Scholar
  5. 5.
    A. Gill, Introduction to the Theory of Finite-State Machine [Russian translation], Nauka, Moscow (1966).Google Scholar
  6. 6.
    S. Ginzburg, The Mathematical Theory of Context-Free Languages [Russian translation], Mir, Moscow (1970).Google Scholar
  7. 7.
    M. O. Rabin and D. Skott, “Finite automata and their decision problems,” in: Kibern. Sborn. (Star. Seriya), Izd. Inostr. Lit., Moscow (1962), pp. 58–98.Google Scholar
  8. 8.
    B. Smith, Computing Patterns in Strings, Pearson Education, UK (2003).Google Scholar
  9. 9.
    R. Alur and D. L. Dill, “A theory of timed automata,” TCS, No. 126, 183–235 (1994).Google Scholar
  10. 10.
    V. M. Glushkov, Synthesis of Digital Automata [in Russian], Fizmatgiz, Moscow (1962).Google Scholar
  11. 11.
    L. Beyga, T. Gajewski, Z. Miadowicz, P. Siwak, J. Stoklosa, J. Bergandy, and B. Mikolajczak, Algebraic and Structural Automata Theory, Elsevier, Amsterdam (1991).MATHGoogle Scholar
  12. 12.
    J. Anderson, Automata Theory with Modern Applications, Cambridge University Press, Cambridge (2006).MATHCrossRefGoogle Scholar
  13. 13.
    B. A. Trakhtenbrot and Ya. M. Barzdin, Finite Automata: Behavior and Synthesis [in Russian], Nauka, Moscow (1970).Google Scholar
  14. 14.
    W. Thomas, “Automata on infinite objects,” in: Handbook on Theoretical Computer Science, Elsevier, Amsterdam (1990), pp. 133–191.Google Scholar
  15. 15.
    F. Gécseg and M. Steinby, Tree Automata, Akademiai Kiado, Hungary (1984).Google Scholar
  16. 16.
    Gécseg F. and M. Steinby, “Tree languages,” in: Handbook of Formal Languages, 3, Elsevier, Amsterdam (1996), pp. 1–68.Google Scholar
  17. 17.
    H. Comon, M. Dauchet, R. Gilleron, F. Jacquemand, D. Lugies, S. Tison, and M. Tommasi, Tree Automata: Techniques and Applications (TATA) (1999),
  18. 18.
    R. W. Freiwald, “Language identification by finite probabilistic multitape and multihead automata,” Probl. Peredachi Inf., 15, No. 3, 99–106 (1979).Google Scholar
  19. 19.
    R. G. Bukharaev, Fundamentals of the Theory of Probabilistic Automata [in Russian], Nauka, Moscow (1985).Google Scholar
  20. 20.
    B. Berard, F. Cassez, D. Haddad, D. Lime, and O. H. Roux, “Comparison of the expressiveness of time automata and time Petri nets,” in: Proc. 3rd Int. Workshop on Formal Analysis and Modeling of Timed Systems (FORMATS’05), LNCS, 3829, Springer (2005), pp. P. 211–225.Google Scholar
  21. 21.
    T. Toffoli and N. Margolus, Cellular Automata Machines [Russian translation], Mir, Moscow (1991).Google Scholar
  22. 22.
    T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya, “What’s decidable about hybrid automata,” J. of Computer and System Science, 57, 94–124 (1998).MathSciNetMATHCrossRefGoogle Scholar
  23. 23.
    S. L. Krivoi, “An algorithm to construct the basis of the intersection of finitely generated free groups,” Cybernetics, Vol. 18, No. 4, 407–414 (1982).MathSciNetCrossRefGoogle Scholar
  24. 24.
    A. A. Letichevskii, A. B. Godlevskii, and S. L. Krivoi, “An efficient algorithm for constructing the basis of a subgroup of a free group,” Cybernetics, Vol. 17, No. 3, 407–415 (1981).MathSciNetCrossRefGoogle Scholar
  25. 25.
    M. Clausen and A. Fortenbacher, “Efficient solution of linear diophantine equations,” J. Symbolic Computation, 8, No. 1, 201–216 (1989).MathSciNetMATHCrossRefGoogle Scholar
  26. 26.
    J. F. Romeuf, “A polynomial algorithm for solving systems of two linear Diophantine equations,” TCS, 74, No. 3, 329–340 (1990).MathSciNetMATHCrossRefGoogle Scholar
  27. 27.
    T. Head, “Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors,” Bull. Math. Biology, No. 49, 737–759 (1987).Google Scholar
  28. 28.
    K. Culik and T. Harju, “The regularity of splicing systems and DNA,” in: Proc. ICALP 89, LNCS, Vol. 372 (1989), pp. 222–233.Google Scholar
  29. 29.
    K. Culik and T. Harju, “Splicing semigroup of dominoes and DNA,” Discrete Applied Mathem., No. 31, 261–277 (1991).Google Scholar
  30. 30.
    R. W. Gatterdam, “Splicing systems and regularity,” Intern. J. Computer Math., No. 31, 63–67 (1989).Google Scholar
  31. 31.
    E. Goode, Constants and Splicing Systems, PhD Thesis, Binghamton University, Binghamton (1999).Google Scholar
  32. 32.
    M. Ben-Ari, Mathematical Logic for Computer Science, Springer, London (2001).MATHCrossRefGoogle Scholar
  33. 33.
    E. M. Clarke, O. Grumberg, and D. Peled, Model Checking, The MIT Press, Cambridge-Massachusetts-London (2001).Google Scholar
  34. 34.
    W. Penczek and A. P_lrola, Advances in Verification of Time Petri Nets and Timed Automata, Springer-Verlag, Berlin–Heidelberg (2006).Google Scholar
  35. 35.
    A. B. Godlevskii and S. L. Krivoi, “Design of effective automaton-reduction algorithms for some equivalence relations,” Cybernetics and Systems Analysis, Vol. 25, No. 6, 772–781 (1989).MathSciNetGoogle Scholar
  36. 36.
    Proc. Conf. “Language and automata theory and a pplications,” LNCS, Vol. 5457 (2009).Google Scholar

Copyright information

© Springer Science+Business Media, Inc. 2011

Authors and Affiliations

  1. 1.Taras Shevchenko National University of KievKyivUkraine

Personalised recommendations