Skip to main content
SpringerLink
Log in

A note on optimal parallel transformations of regular expressions to nondeterministic finite automata

  • Communications
  • Conference paper
  • First Online:
Parallel Algorithms and Architectures

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. I. Bar-On, and U. Vishkin., Optimal parallel generation of a computation tree form. ACM Trans.on Progr.Lang.and Systems 7,2 (1985) 348–357

    Article  Google Scholar 

  2. R.Cole. An optimal selection algorithm. Ultracomputer Note #97, Courant Institute of Math.Sciences, march (1986)

    Google Scholar 

  3. 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 

  4. S.Fortune, J. Wyllie. Parallelism in random access machines, Proceedings of 10th ACM Symp. on tHeoretical Computer SCience (1978) 114–118

    Google Scholar 

  5. J. Hopcroft,J.Ullman. Introduction to automata theory, languages and computations. Chapter 2. Addison-Wesley (1979)

    Google Scholar 

  6. 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 

  7. W.Rytter. Optimal parallel parsing of bracket languages. Research Report RR84, Dept. of Computer Science, University of Warwick (1986)

    Google Scholar 

  8. R.Sedgewick. Algorithms. Chapter 20. Addison-Wesley (1983)

    Google Scholar 

  9. U. Vishkin. Optimal parallel pattern matching in strings. in Automata, languages, computation (ed.W.Brauer), Lect.Notes in Comp. Science 194 (1985) 497–508

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Warwick, CV4 7AL, Coventry, U.K.

    Wojciech Rytter

  2. Institute of Informatics, Warsaw University, PKiN VIII p, sk.poczt.1210, 00-901, Warszawa, Poland

    Wojciech Rytter

Authors
  1. Wojciech Rytter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andreas Albrecht Hermann Jung Kurt Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rytter, W. (1987). A note on optimal parallel transformations of regular expressions to nondeterministic finite automata. In: Albrecht, A., Jung, H., Mehlhorn, K. (eds) Parallel Algorithms and Architectures. Lecture Notes in Computer Science, vol 269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18099-0_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-18099-0_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18099-9

  • Online ISBN: 978-3-540-47760-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation