Skip to main content
SpringerLink
Log in

Some algorithms for equivalent transformation of nondeterministic finite automata

  • Published:
Russian Mathematics Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

In this paper we consider algorithms which allow one to combine several states of a nondeterministic finite automaton into one state. Along with the algorithms for combining states, we adduce one more algorithm for the equivalent transformation of a non-deterministic finite automaton, namely, an algorithm for adding cycles. Problems under consideration imply the development of robust computer programs.

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; Radio i Svyaz’,Moscow, 1987).

    MATH  Google Scholar 

  2. A. Salomaa, Jewels of Formal Language Theory (Computer Science Press, Rockville, MD, 1981; Mir, Moscow, 1986).

    Google Scholar 

  3. B. F. Mel’nikov, “Multiheuristic Approach to Discrete Optimization Problems,” Kibernetika i Sistemnyi Analiz (NAN Ukrainy) No. 3, 32–42 (2006).

  4. B. Melnikov and N. Sciarini-Guryanova, “Possible Edges of a Finite Automaton Defining the Given Regular Language,” The Korean J. Comput. and Appl. Math. 9(2), 475–485 (2002).

    MATH  MathSciNet  Google Scholar 

  5. Y.-S. Han and D. Wood, “The Generalization of Generalized Automata: Expression Automata,” in Proceedings of the 9th International Confererence on Implementation and Application of Automata, 2004, P. 114–122.

  6. B. Mel’nikov, “On an Expansion of Nondeterministic Finite Automata,” J. Appl. Math. Comput. 24(1), 155–165 (2007).

    Article  MathSciNet  Google Scholar 

  7. B. F. Mel’nikov, “On ω-Languages of Special Billiards,” Diskretn. Matem. (RAN) No. 3, 95–108 (2002).

Download references

Author information

Authors and Affiliations

  1. Togliatti State University, 14 Belorusskaya str., Togliatti, 445667, Russia

    B. F. Mel’nikov & M. R. Saifullina

Authors
  1. B. F. Mel’nikov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. R. Saifullina
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to B. F. Mel’nikov.

Additional information

Original Russian Text © B.F. Mel’nikov, M.R. Saifullina, 2009, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2009, No. 4, pp. 67–71.

About this article

Cite this article

Mel’nikov, B.F., Saifullina, M.R. Some algorithms for equivalent transformation of nondeterministic finite automata. Russ Math. 53, 54–57 (2009). https://doi.org/10.3103/S1066369X09040100

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1066369X09040100

Key words and phrases

Search

Navigation