A note on optimal parallel transformations of regular expressions to nondeterministic finite automata
Part of the Lecture Notes in Computer Science book series (LNCS, volume 269)
KeywordsRegular Expression Finite Automaton Outgoing Edge Sequential Algorithm Parse Tree
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- R.Cole. An optimal selection algorithm. Ultracomputer Note #97, Courant Institute of Math.Sciences, march (1986)Google Scholar
- A.Gibbons, W.Rytter. An optimal parallel algorithm for dynamic expression evvaluation and its applications.Accepted for Found.of Software Techn.and Theor. Comp. Science,to appear in Lect.Notes in Comp. Science, Springer-Verlag, december (1986).Google Scholar
- S.Fortune, J. Wyllie. Parallelism in random access machines, Proceedings of 10th ACM Symp. on tHeoretical Computer SCience (1978) 114–118Google Scholar
- J. Hopcroft,J.Ullman. Introduction to automata theory, languages and computations. Chapter 2. Addison-Wesley (1979)Google Scholar
- G. Kindervater and J. Lenstra. An introduction to parallelism in combinatorial optimization. Report OS-R8501, Centre for Mathematics and Computer Science, Amsterdam (1984)Google Scholar
- W.Rytter. Optimal parallel parsing of bracket languages. Research Report RR84, Dept. of Computer Science, University of Warwick (1986)Google Scholar
- R.Sedgewick. Algorithms. Chapter 20. Addison-Wesley (1983)Google Scholar
- U. Vishkin. Optimal parallel pattern matching in strings. in Automata, languages, computation (ed.W.Brauer), Lect.Notes in Comp. Science 194 (1985) 497–508Google Scholar
© Springer-Verlag Berlin Heidelberg 1987