A note on optimal parallel transformations of regular expressions to nondeterministic finite automata
References (9)
- et al.
Optimal parallel generation of a computation tree form
ACM Trans. on Progr. Lang. and Systems
(1985) An optimal selection algorithm
- et al.
An optimal parallel algorithm for dynamic expression evaluation and its applications
- et al.
Parallelism in random access machines
There are more references available in the full text version of this article.
Cited by (6)
An optimal parallel algorithm to convert a regular expression into its Glushkov automaton
1999, Theoretical Computer ScienceUsefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
1991, Theoretical Computer ScienceParallel construction of minimal suffix and factor automata
1990, Information Processing LettersParallel algorithms on strings
2007, Handbook of Parallel Computing: Models, Algorithms and ApplicationsParallel construction of minimal suffix and factor automata
1990, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Parallel computations on strings and arrays
1990, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 1989 Published by Elsevier B.V.