Abstract
The minimization of finite Automata model is deeply analyzed, and a parallel algorithm of minimization based on distinguishable state table is proposed. The parallel processing of algorithm is described in detail with an example, and its feasibility is verified.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
John, E.H., Jeffrey, D.U.: Introduction to Automata Theory, Languages and Computation, 2nd edn. China Machine Press, Beijing (2004)
Chen, H.W., Liu, C.L., Tan, Q.-P.: Programmer Compile Theory. National defence industry publisher, Beijing (2003)
Jiang, Z.L., Jiang, S.X.: Formal Language and Automata Theory. Qinghua University Press, Beijing (2002)
Piercarlo, G.: Implementing (nondeterministic) Parallel Assignments. Information processing letters 58, 177–179 (1996)
Alfred, C.K., Malcolm, Y.H.: Loop Parallelization Tool for Message-passing Systems. Microprocessors and Microsystems 20, 409–421 (1997)
Chen, G.L.: Parallel Compute–structure, Arithmetic, Program. Higher education publisher, Beijing (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, YQ., Lu, HL., Li, YP., Wang, HY. (2007). Parallel Processing of Minimization Algorithm for Determination Finite Automata. In: Huang, DS., Heutte, L., Loog, M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Contemporary Intelligent Computing Techniques. ICIC 2007. Communications in Computer and Information Science, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74282-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-74282-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74281-4
Online ISBN: 978-3-540-74282-1
eBook Packages: Computer ScienceComputer Science (R0)