Author:
Ng Timothy,Rappaport David,Salomaa Kai
Publisher
Springer International Publishing
Reference20 articles.
1. Bordihn, H., Holzer, M., Kutrib, M.: Determination of finite automata accepting subregular languages. Theoretical Computer Science 410, 3209–3249 (2009)
2. Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Communications of ACM 20, 762–772 (1977)
3. Lecture Notes in Computer Science;J Brzozowski,2010
4. Calude, C.S., Salomaa, K., Yu, S.: Additive Distances and Quasi-Distances Between Words. Journal of Universal Computer Science 8(2), 141–152 (2002)
5. Deza, M.M., Deza, E.: Encyclopedia of Distances. Springer-Verlag, Heidelberg (2009)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献