Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Izv. Vyssh. Uchebn. Zaved. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2009, Number 4, Pages 67–71 (Mi ivm1323)  

This article is cited in 5 scientific papers (total in 5 papers)

Brief communications

Some algorithms for equivalent transformation of nondeterministic finite automata

B. Melnikov, M. R. Saifullina

Togliatti State University
Full-text PDF (163 kB) Citations (5)
References:
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.
Keywords: nondeterministic finite automata, equivalent transformation, extended automaton, combining states.
Received: 11.01.2005
Revised: 16.09.2008
English version:
Russian Mathematics (Izvestiya VUZ. Matematika), 2009, Volume 53, Issue 4, Pages 54–57
DOI: https://doi.org/10.3103/S1066369X09040100
Bibliographic databases:
Document Type: Article
UDC: 519.6
Language: Russian
Citation: B. Melnikov, M. R. Saifullina, “Some algorithms for equivalent transformation of nondeterministic finite automata”, Izv. Vyssh. Uchebn. Zaved. Mat., 2009, no. 4, 67–71; Russian Math. (Iz. VUZ), 53:4 (2009), 54–57
Citation in format AMSBIB
\Bibitem{MelSai09}
\by B.~Melnikov, M.~R.~Saifullina
\paper Some algorithms for equivalent transformation of nondeterministic finite automata
\jour Izv. Vyssh. Uchebn. Zaved. Mat.
\yr 2009
\issue 4
\pages 67--71
\mathnet{http://mi.mathnet.ru/ivm1323}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2581477}
\transl
\jour Russian Math. (Iz. VUZ)
\yr 2009
\vol 53
\issue 4
\pages 54--57
\crossref{https://doi.org/10.3103/S1066369X09040100}
Linking options:
  • https://www.mathnet.ru/eng/ivm1323
  • https://www.mathnet.ru/eng/ivm/y2009/i4/p67
  • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Известия высших учебных заведений. Математика Russian Mathematics (Izvestiya VUZ. Matematika)
    Statistics & downloads:
    Abstract page:585
    Full-text PDF :84
    References:31
    First page:19
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024