Abstract
In this paper we consider the corrected version of the algorithm of the state-minimization for the nondeterministic finite automata: we correct here a mistake of the previous paper, where the same problem was considered.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B. Melnikov: A new algorithm of the state-minimization for the nondeterministic finite automata. —The Korean Journal of Computational and Applied Mathematics, Vol. 6, No. 2 (1999) 277–290.
W. Brauer :Automatentheorie. Eine Einführung in die Theorie endlicher Automaten, B. G. Teubner Stuttgart, 1984.
Additional information
This work was supported by the Russian Foundation of the Basic Research (projects No. 99-01-00907 and 00-15-99253).
Rights and permissions
About this article
Cite this article
Melnikov, B.F. Once more about the state-minimization of the nondeterministic finite automata. Korean J. Comput. & Appl. Math. 7, 655–662 (2000). https://doi.org/10.1007/BF03012275
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03012275