![](/img/cover-not-exists.png)
[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říVolume:
10.1007/BF
Year:
1998
Language:
english
DOI:
10.1007/bfb0055777
File:
PDF, 501 KB
english, 1998