A new algorithm of the state-minimization for the nondeterministic finite automata

Journal of Applied Mathematics and Computing

Volumn 6, Issue 2, 1999, Pages 277-290

  Melnikov, B F ^a  

^a ULYANOVSK STATE UNIVERSITY   (Russian Federation)

Author keywords

Finite automata; Regular languages; State minimization

Indexed keywords

COMPUTATIONAL METHODS; FORMAL LANGUAGES; MATHEMATICAL TECHNIQUES;

CANONICAL FORM; GENERATIVE SYSTEMS; LOCAL REACTIONS; NONDETERMINISTIC FINITE AUTOMATON; SPECIAL FUNCTIONS; STATE MINIMIZATION;

FINITE AUTOMATA;

EID: 0039893762     PISSN: 15985865     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf03014374     Document Type: Article

References (7)

1. T. Kameda, P. Weiner. On the state minimization of nondeterministic finite automata, IEEE Trans. on Computers, C-19 (1970) 617-627.
2. K. Indermark. Zur Zustandsminimisierung nichtdeterministischer endlicher Automaten, Berichte der Gesellschaft für Mathematik und Datenverarbeitung, Bonn, 33 (1970).
3. J. Kim. State Minimization of Nondeterministic Machines, IBM T.J. Watson Research Center Yorktown Heights RC 4896 (1974).
4. W. Brauer. Automatentheorie. Eine Einführung in die Theorie endlicher Automaten, B. G.Teubner Stuttgart, 1984.
5. B. Melnikov, A.Vakhitova. Some more on the finite automata, The Korean Journal of Computational and Applied Mathematics, Vol. 5, No. 3, (1998).
6. D.Perrin. Finite Automata. Handbook of Theoret. Comput. Sci., Elsevier Sci. Publ., 1990.
7. B. Melnikov, A.Vakhitova. Applying the finite automata in various tasks of theformal languages theory, Programmirovanie (Russian Academy of Sciences Ed.), 1998 (submitted, in Russian).