Geodesic
Some algorithms for equivalent transformation of nondeterministic finite automata
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 4 (2009), pp. 67-71.

Voir la notice de l'article provenant de la source Math-Net.Ru

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, extended automaton, combining states.
Mots-clés : equivalent transformation 
@article{IVM_2009_4_a9,
     author = {B. Melnikov and M. R. Saifullina},
     title = {Some algorithms for equivalent transformation of nondeterministic finite automata},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {67--71},
     publisher = {mathdoc},
     number = {4},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2009_4_a9/}
}
TY  - JOUR
AU  - B. Melnikov
AU  - M. R. Saifullina
TI  - Some algorithms for equivalent transformation of nondeterministic finite automata
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2009
SP  - 67
EP  - 71
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2009_4_a9/
LA  - ru
ID  - IVM_2009_4_a9
ER  - 
%0 Journal Article
%A B. Melnikov
%A M. R. Saifullina
%T Some algorithms for equivalent transformation of nondeterministic finite automata
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2009
%P 67-71
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2009_4_a9/
%G ru
%F IVM_2009_4_a9
B. Melnikov; M. R. Saifullina. Some algorithms for equivalent transformation of nondeterministic finite automata. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 4 (2009), pp. 67-71. http://geodesic.mathdoc.fr/item/IVM_2009_4_a9/

[1] Brauer V., Vvedenie v teoriyu konechnykh avtomatov, Radio i svyaz, M., 1987, 392 pp. | MR

[2] Salomaa A., Zhemchuzhiny teorii formalnykh yazykov, Mir, M., 1986, 159 pp. | MR

[3] Melnikov B. F., “Multievristicheskii podkhod k zadacham diskretnoi optimizatsii”, Kibernetika i sistemnyi analiz (NAN Ukrainy), 2006, no. 3, 32–42 | MR | Zbl

[4] Melnikov B., Sciarini-Guryanova N., “Possible edges of a finite automaton defining the given regular language”, The Korean J. Comput. and Appl. Math., 9:2 (2002), 475–485 | MR | Zbl

[5] Han Y.-S., Wood D., “The generalization of generalized automata: expression automata”, The 9th Internat. Confer. on Implement. and Appl. of Automata, 2004, 114–122 | MR

[6] Melnikov B., “On an expansion of nondeterministic finite automata”, J. Appl. Math. Comput., 24:1 (2007), 155–165 | DOI | MR

[7] Melnikov B. F., “Ob $\omega$-yazykakh spetsialnykh billiardov”, Diskretnaya matem., 14:3 (2002), 95–108 | MR | Zbl