Author:
Gruber Hermann,Holzer Markus,Wolfsteiner Simon
Publisher
Springer International Publishing
Reference25 articles.
1. Abboud, A., Backurs, A., Williams, V.V.: If the current clique algorithms are optimal, so is Valiant’s parlser. SIAM J. Comput. 47(6), 2527–2555 (2015)
2. Bringmann, K., Grønlund, A., Larsen, K.G.: A dichotomy for regular expression membership testing. In: Proceedings of the $$58$$th Annual IEEE Symposium on Foundations of Computer Science, pp. 307–318. IEEE, Berkeley, October 2017
3. Lecture Notes in Computer Science;P Chalermsook,2014
4. Clemente, L., Mayr, R.: Efficient reduction of nondeterministic automata with application to language inclusion testing. Log. Methods Comput. Sci. 15(1) (2019)
5. Lecture Notes in Computer Science;M de Oliveira Oliveira,2020
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献