Skip to main content
SpringerLink
Log in

Some more on the finite automata

  • Published:
Korean Journal of Computational & Applied Mathematics Aims and scope Submit manuscript

Abstract

Some new problems of the theory of the finite automata are considered. Applying the finite automata in various tasks of the formal languages theory is observed.

Special proof of Kleene’s theorem is obtained. This proof is used for the defining the star-height of the finite automaton. The properties of the last object are considered.

The star-height of the finite automaton is used for reformulating the star-height problem of regular expressions for finite automata. The method of the reduction of the star-height problem to the task of making special finite automaton is obtained. This reformulating can help to solve the star-height problem by new way.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. V. Aho, R.Sethi and J.D.Ullman.Compilers: principles, techniques and tools, N. J., Addison-Wesley, 1985.

  2. A. Aho and J. Ullman.The theory of parsing, translation and compiling. V. 1: Parsing, N. J., Prentice-Hall, Inc., Englewod Cliffs, 1972.

    Google Scholar 

  3. W. Brauer.Automatentheorie. Eine Einführung in die Theorie endlicher Automaten, B.G.Teubner Stuttgart, 1984.

    Google Scholar 

  4. K. Hashiguchi: Algorithms for determining relative star height and star height. -Inform. Comput., 78 (1987) 124–169.

    Article  MathSciNet  Google Scholar 

  5. B. Melnikov.On the classification of sequential context-free languages and grammars, Vestnik Moskovskogo Universiteta, ser. 15, Vol. 3 (1993) 64–69 (in Russian).

    MathSciNet  Google Scholar 

  6. D. Perrin.Finite Automata. Handbook of Theoret. Comput. Sci., Elsevier Sci. Publ., 1990.

  7. Salomaa.Jewels of the formal languages theory, 1979.

  8. N. Wirth.Algorithmes + data structures = programs, 1979.

Download references

Author information

Authors and Affiliations

  1. Department of Mecanics and Mathematics, Simbirsk State University, L.Tolstoy str., 42, 432700, Simbirsk (Ulyanovsk), Russia

    B. F. Melnikov

  2. Department of Applied Mathematics, Branch of Simbirsk Polytekhnik University, P.O.Box A-2116, 433510, Dimitrovgrad, Russia

    A. A. Vakhitova

Authors
  1. B. F. Melnikov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. A. Vakhitova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to B. F. Melnikov.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Melnikov, B.F., Vakhitova, A.A. Some more on the finite automata. Korean J. Comput. & Appl. Math. 5, 495–505 (1998). https://doi.org/10.1007/BF03008877

Download citation

  • Received:

  • Published:

  • Issue Date:

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

AMS Mathematics Subject Classification

Key word and phrases

Search

Navigation