[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 1998 Volume 1450 || Computing ε-free NFA from regular expressions in O(n log2(N)) time
Brim, Luboš; Gruska, Jozef; Zlatuška, Jiří
- 作者Brim, Luboš; Gruska, Jozef; Zlatuška, Jiří
- 文件大小501.32KB
- 发表时间1998
- DOI10.1007/bfb0055777
- 页码277-285