Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Lecture Notes in Computer Science;J. Sakarovitch,2006
2. Glushkov, V.M.: The abstract theory of automata. Russian Math. Surveys 16, 1–53 (1961)
3. Lecture Notes in Computer Science;J. Hromkovic,1997
4. Hagenah, C., Muscholl, A.: Computing epsilon-free NFA from regular expressions in O(n log2(n)) time. ITA 34(4), 257–278 (2000)
5. Lecture Notes in Computer Science;L. Ilie,2002
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献