Skip to main content
SpringerLink
Log in

A Parallel DFA Minimization Algorithm

  • Conference paper
  • First Online:
High Performance Computing — HiPC 2002 (HiPC 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2552))

Included in the following conference series:

Abstract

In this paper,we have considered the state minimization problem for Deterministic Finite Automata (DFA). An efficient parallel algorithm for solving the problem on an arbitrary CRCW PRAM has been proposed. For n number of states and k number of inputs in Σ of the DFA to be minimized,the algorithm runs in O(kn log n) time and uses O( n/log n ) processors.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Aho A. V., Hopcroft J.E. and Ullman J. D.: The design and analysis of computer algorithms. Addison-Wesley,Reading, Massachusetts (1974) 35, 36

    Google Scholar 

  2. Blum N.: An O(n log n) implementation of the standard method of minimizing n-state finite automata. Information Processing Letters 57 (1996) 65–6935

    Article  MATH  MathSciNet  Google Scholar 

  3. Cho S. and Huynh D.T.: The parallel complexity of coarsest set partition problems. Information Processing Letters 42 (1992) 89–94 35, 36

    Article  MATH  MathSciNet  Google Scholar 

  4. Huffman D.A.: The Synthesis of Sequential Switching Circuits. Journal of Franklin Institute 257 (1954) 161–190 34

    Article  MathSciNet  Google Scholar 

  5. Hopcroft J.E.: An n log n algorithm for minimizing states in a finite automata. Theory of Machines and Computation,A cademic Press (1971) 189–19635

    Google Scholar 

  6. Hopcroft J.E. and Ullman J.D.: Introduction to automata theory,languages, and computation. Addison-Wesley,Reading, Massachusetts (1979) 34

    Google Scholar 

  7. Jaja J. and Kosaraju S.R.: Parallel algorithms for planar graph isomorphism and related problems. IEEE Transactions on Circuits and Systems 35 (1988) 304–311 35

    Article  MATH  MathSciNet  Google Scholar 

  8. Jaja J. and Ryu K.W.: An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem. Theoretical Computer Science 129 (1994) 293–307 35

    Article  MATH  MathSciNet  Google Scholar 

  9. Matias Y. and Vishkin U.: On parallel hashing and integer sorting. Journal of Algorithms 4 (1991) 573–606 37, 38

    Article  MathSciNet  Google Scholar 

  10. Moore E. F.: Gedanken-experiments on sequential circuits. Automata Studies, Princeton University Press (1956) 129–153 34

    Google Scholar 

  11. Paige R., Tarjan R. E. and Bonic R.: A linear time solution to the single function coarsest partition problem. Theoretical Computer Science 40 (1985) 67–84 36

    Article  MATH  MathSciNet  Google Scholar 

  12. Ravikumar B. and Xiong X.: A parallel algorithm for minimization of finite automata. Proceedings of the 10th International Parallel Processing Symposium, Honululu,Hawaii (1996) 187–191 35

    Google Scholar 

  13. Srikant Y.N.: A parallel algorithm for the minimization of finite state automata. International Journal Computer Math. 32 (1990) 1–11 35

    Article  MATH  Google Scholar 

  14. Vardi M.: Nontraditional applications of automata theory. Lecture Notes in Computer Science,Springer-Verlag 789 (1994) 575–597 34

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering, Indian Institute of Technology Kanpur, 208 016, Kanpur, INDIA

    Ambuj Tewari, Utkarsh Srivastava & P. Gupta

Authors
  1. Ambuj Tewari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Utkarsh Srivastava
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CISE Department, University of Florida, 32611, FL, Gainesville, USA

    Sartaj Sahni

  2. Department of Electrical Engineering, EEB 200C, University of Southern California, 3740 McClintok Ave., 90089-2562, CA, Los Angeles, USA

    Viktor K. Prasanna

  3. India Software Lab, IBM Global Services India Exports, Golden Enclave, TISL Tower, Airport Road, 560 017, Bangalore, India

    Uday Shukla

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tewari, A., Srivastava, U., Gupta, P. (2002). A Parallel DFA Minimization Algorithm. In: Sahni, S., Prasanna, V.K., Shukla, U. (eds) High Performance Computing — HiPC 2002. HiPC 2002. Lecture Notes in Computer Science, vol 2552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36265-7_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-36265-7_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00303-8

  • Online ISBN: 978-3-540-36265-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation