ZHOU Qi-hai. Automata Transform Algorithm for “NFA→FA→GFA”[J]. Journal of University of Electronic Science and Technology of China, 2005, 34(3): 363-365,395.
Citation:
ZHOU Qi-hai. Automata Transform Algorithm for “NFA→FA→GFA”[J]. Journal of University of Electronic Science and Technology of China, 2005, 34(3): 363-365,395.
ZHOU Qi-hai. Automata Transform Algorithm for “NFA→FA→GFA”[J]. Journal of University of Electronic Science and Technology of China, 2005, 34(3): 363-365,395.
Citation:
ZHOU Qi-hai. Automata Transform Algorithm for “NFA→FA→GFA”[J]. Journal of University of Electronic Science and Technology of China, 2005, 34(3): 363-365,395.
The essential relationship and equal value transformation of Non-Finite Automat, Finite Automat and Gauge Finite Automat (abbreviated as NFA, FA & GFA) is studied. An equal value transforming algorithms of "NFA→FA" and "FA→GFA" are given, the existing nature from FA To GFA is proved by construction, with which the basis of an algorithm research on the minimum of an Automat is provided.
ISSN 
DownLoad: