External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time

Christian Hagenah, Anca Muscholl. Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time. In Lubos Brim, Jozef Gruska, Jirí Zlatuska, editors, Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS 98, Brno, Czech Republic, August 24-28, 1998, Proceedings. Volume 1450 of Lecture Notes in Computer Science, pages 277-285, Springer, 1998. [doi]

Authors

Christian Hagenah

This author has not been identified. Look up 'Christian Hagenah' in Google

Anca Muscholl

This author has not been identified. Look up 'Anca Muscholl' in Google
runs on