Skip to main content

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 2))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. John, E.H., Jeffrey, D.U.: Introduction to Automata Theory, Languages and Computation, 2nd edn. China Machine Press, Beijing (2004)

    Google Scholar 

  2. Chen, H.W., Liu, C.L., Tan, Q.-P.: Programmer Compile Theory. National defence industry publisher, Beijing (2003)

    Google Scholar 

  3. Jiang, Z.L., Jiang, S.X.: Formal Language and Automata Theory. Qinghua University Press, Beijing (2002)

    Google Scholar 

  4. Piercarlo, G.: Implementing (nondeterministic) Parallel Assignments. Information processing letters 58, 177–179 (1996)

    Article  MATH  Google Scholar 

  5. Alfred, C.K., Malcolm, Y.H.: Loop Parallelization Tool for Message-passing Systems. Microprocessors and Microsystems 20, 409–421 (1997)

    Article  Google Scholar 

  6. Chen, G.L.: Parallel Compute–structure, Arithmetic, Program. Higher education publisher, Beijing (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

De-Shuang Huang Laurent Heutte Marco Loog

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics