Skip to main content
SpringerLink
Log in

Possible edges of a finite automaton defining a given regular language

  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

In this paper we consider non-deterministic finite Rabin-Scott’s automata. We define special abstract objects, being pairs of values of states-marking functions. On the basis of these objects as the states of automaton, we define its edges; the obtained structure is considered also as a non-deterministic automaton. We prove, that any edge of any non-deterministic automaton defining the given regular language can be obtained by such techniques. Such structure can be used for solving various problems in the frames of finite automata theory.

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. W. Brauer,Automatentheorie. Eine Einführung in die Theorie endlicher Automaten, B.G. Teubner Stuttgart, 1984.

  2. B. Melnikov and A. Vakhitova,Some more on the finite automata, The Korean Journal of Computational and Applied Mathematics, Vol.5, No.3 (1998), 495–506.

    Article  MathSciNet  MATH  Google Scholar 

  3. B. Melnikov,A new algorithm of the state-minimization for the nondeterministic finite automata, The Korean Journal of Computational and Applied Mathematics, Vol.6, No.2 (1999), 277–290.

    Article  MathSciNet  MATH  Google Scholar 

  4. B. Melnikov,Once more about the state-minimization of the nondeterministic finite automata, The Korean Journal of Computational and Applied Mathematics, Vol.7, No.3 (2000), 655–662.

    Article  MathSciNet  MATH  Google Scholar 

  5. A. Salomaa,Jewels of the formal languages theory, 1979.

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

  7. A. Vakhitova,The basis automaton for the given regular language, The Korean Journal of Computational and Applied Mathematics, Vol.6, No.3 (1999), 617–624.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Technologies, Simbirsk State University, L.Tolstoy str., 42, 432700, Simbirsk (Ulyanovsk), Russia

    B. F. Melnikov & N. V. Sciarini-Guryanova

Authors
  1. B. F. Melnikov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. V. Sciarini-Guryanova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to B. F. Melnikov.

Additional information

The first author was supported by the Russian Foundation of the Basic Research (project No. 00-15-99253)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Melnikov, B.F., Sciarini-Guryanova, N.V. Possible edges of a finite automaton defining a given regular language. Korean J. Comput. & Appl. Math. 9, 475–485 (2002). https://doi.org/10.1007/BF03021555

Download citation

  • Received:

  • Published:

  • Issue Date:

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

AMS Mathematics Subject Classification

Key words and phrases

Search

Navigation