Author:
Blanchet-Sadri Francine,Goldner Kira,Shackleton Aidan
Publisher
Springer International Publishing
Reference8 articles.
1. Lecture Notes in Computer Science;E. Balkanski,2013
2. Björklund, H., Martens, W.: The tractability frontier for NFA minimization. Journal of Computer and System Sciences 78, 198–210 (2012)
3. Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall/CRC Press, Boca Raton (2008)
4. Dassow, J., Manea, F., Mercaş, R.: Regular languages of partial words. Information Sciences 268, 290–304 (2014)
5. Groz, B., Maneth, S., Staworko, S.: Deterministic regular expressions in linear time. In: 31th ACM Symposium on Principles of Database Systems, PODS 2012, pp. 49–60 (2012)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Minimal partial languages and automata;RAIRO - Theoretical Informatics and Applications;2017-04