Author:
Holzer Markus,Jakobi Sebastian
Publisher
Springer Berlin Heidelberg
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities;Electronic Proceedings in Theoretical Computer Science;2016-09-13
2. Boundary sets of regular and context-free languages;Theoretical Computer Science;2016-01
3. Hyper-optimization for deterministic tree automata;Theoretical Computer Science;2015-05
4. Minimization of symbolic automata;ACM SIGPLAN Notices;2014-01-13
5. Minimization of symbolic automata;Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages;2014-01-08