CONVERTING AN AFN TO A AFD
DOI:
https://doi.org/10.15381/idata.v6i1.5983Keywords:
Non-Determinist Finite Automaton, Determinist Finite Automaton, Transition graph, Subset construction.Abstract
This article presents the change from a non-determinist fnite automaton (AFN) into a determinist finite automaton (AFD), making use of a subset construction. The subset construction algorithm is based on the transitive closure or ? ?lock. Its implementation is done through a C++ language program, whose code and output are thoroughly presented.
Downloads
Downloads
Published
Issue
Section
License
Copyright (c) 2003 Edgar Ruiz L., Eduardo Raffo L.
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
AUTHORS RETAIN THEIR RIGHTS:
a. Authors retain their trade mark rights and patent, and also on any process or procedure described in the article.
b. Authors retain their right to share, copy, distribute, perform and publicly communicate their article (eg, to place their article in an institutional repository or publish it in a book), with an acknowledgment of its initial publication in the INDUSTRIAL DATA.
c. Authors retain theirs right to make a subsequent publication of their work, to use the article or any part thereof (eg a compilation of his papers, lecture notes, thesis, or a book), always indicating the source of publication (the originator of the work, journal, volume, number and date).
