Asia-Pacific Youth Conference on Communication Technology (APYCCT 2010 E-BOOK)

Kunming,China,8.7-8.8，2010

ISBN: 978-1-935068-20-4 Scientific Research Publishing, USA

E-Book 934pp Pub. Date: August 2010

Category: Computer Science & Communications

Price: $120

Title:	Minimizing a Class of Non-Deterministic Finite Automata
Source:	Asia-Pacific Youth Conference on Communication Technology (APYCCT 2010 E-BOOK)(Part 3 Computer Technology and Application) (pp 471-474)
Author(s):	Li Zhang, College of Computer Science and Information, Guizhou University, Guiyang 550025, China
Abstract:	Given a deterministic finite automata(DFA), we construct the corresponding closure automata with closure operation on the language accepted by DFA. This automata is non-deterministic finite automata(NFA). We minimize this NFA by state equivalence relation of DFA, so that condition numbers is less on the premise of accepted language does not change.

Proceedings by Subjects

Resources

Products

Follow SCIRP