|
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
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
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
Linking options:
https://www.mathnet.ru/eng/ivm1323 https://www.mathnet.ru/eng/ivm/y2009/i4/p67
|
Statistics & downloads: |
Abstract page: | 585 | Full-text PDF : | 84 | References: | 31 | First page: | 19 |
|