Author:
Bassino Frédérique,Giambruno Laura,Nicaud Cyril
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Berstel, J., Perrin, D.: Theory of Codes. Academic Press, London (1985)
2. Lecture Notes in Computer Science;C. Campeanu,2001
3. Campeanu, C., Salomaa, K., Yu, S.: State complexity of regular languages: finite versus infinite. In: Calude, C.S., Paun, G. (eds.) Finite Versus Infinite: Contributions to an Eternal Dilemma, pp. 53–73. Springer, Heidelberg (2000)
4. Clément, J., Duval, J.-P., Guaiana, G., Perrin, D., Rindone, G.: Parsing with a finite dictionary. Theoretical Computer Science 340, 432–442 (2005)
5. Ellul, K., Krawetz, B., Shallit, J., Wang, M.-W.: Regular expressions: new results and open problems. J. Autom. Lang. Combin. 10, 407–437 (2005)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献