A Parallel DFA Minimization Algorithm-Reference-Cited by-同舟云学术

A Parallel DFA Minimization Algorithm

Published:2002 Issue: Volume: Page:34-40
ISSN:0302-9743
Container-title:High Performance Computing — HiPC 2002
language:
Short-container-title:

Author:

Tewari Ambuj,Srivastava Utkarsh,Gupta P.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-36265-7_4

Reference14 articles.

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

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

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

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

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

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Linear parallel algorithms to compute strong and branching bisimilarity;Software and Systems Modeling;2022-12-06

2. A Comparative Study of Large Automata Distributed Processing;2022 IEEE 16th International Conference on Application of Information and Communication Technologies (AICT);2022-10-12

3. A BSP Based Approach for NFAs Intersection;Algorithms and Architectures for Parallel Processing;2020

4. SRASA: a Generalized Theoretical Framework for Security and Reliability Analysis in Computing Systems;Journal of Hardware and Systems Security;2018-09-12

5. Faster exact distributions of pattern statistics through sequential elimination of states;Annals of the Institute of Statistical Mathematics;2015-09-18