Powiadomienia systemowe
- Sesja wygasła!
- Sesja wygasła!
Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
We consider a new expansion of nondeterministic finite automata. The goals of this consideration are: to apply some algorithms of such expansion for various problems of minimization of classical nondeterministic automata; to use such automata for describing practical anytime algorithms for the same problems of minimization; using such automata, we often can simplify some proofs for algorithms of simplification of usual nondeterministic automata.
Wydawca
Czasopismo
Rocznik
Tom
Strony
255--265
Opis fizyczny
Bibliogr. 3 poz., wykr.
Twórcy
autor
- Faculty of Mathematics and Informatics, Togliatti State University, Belorusskaya 14, 445667 Togliatti, Russia, B.Melnikov@tltsu.ru
Bibliografia
- [1] Han, Y.-S., Wood, D. : The generalization of generalized automata: expression automata - The 9th International Conference on Implementation and Application of Automata, 2004, 114-122.
- [2] Melnikov, B. : Discrete optimization problems - some new heuristic approaches - The 8th International Conference on High-Perfomance Computing and Grid in Asia-Pacific Region, IEEE Comp. Soc. Press Ed., 2005, 73-80.
- [3] Melnikov, B., Sciarini-Guryanova, N. : Possible edges of a finite automaton defining a given regular language - The Korean Journal of Computational and Applied Mathematics, Vol. 9, No. 2 (2002) 475-485.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS8-0011-0031