The Parallel Determination and Process Analysis of NFA

The equivalence and conversion of NFA (non-determination finite automata) and DFA (determination finite automata) in parallel environment are researched, the method and algorithm of NFA converted to DFA are labored, and an example of the process of parallel conversion is given.

Saved in:
Bibliographic Details
Published in2009 First International Workshop on Education Technology and Computer Science Vol. 3; pp. 354 - 357
Main Authors Sun Yuqiang, Gu Yuwan, Wang Mingfei, Wang Haiyan
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.03.2009
Subjects
Algorithm design and analysis
Automata
Computer science
Computer science education
DFA
Doped fiber amplifiers
Educational technology
Information science
Information technology
NFA
Parallel conversion
Software algorithms
Sun
Online AccessGet full text

Cover

More Information
Summary:The equivalence and conversion of NFA (non-determination finite automata) and DFA (determination finite automata) in parallel environment are researched, the method and algorithm of NFA converted to DFA are labored, and an example of the process of parallel conversion is given.
ISBN:1424435811
9781424435814
0769535577
9780769535579
DOI:10.1109/ETCS.2009.606