Funder
Narodowe Centrum Nauki
Natural Sciences and Engineering Research Council of Canada
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference33 articles.
1. Ang, T., Brzozowski, J.A.: Languages convex with respect to binary relations, and their closure properties. Acta Cybernet. 19(2), 445–464 (2009)
2. Brzozowski, J.A.: Quotient complexity of regular languages. J. Autom. Lang. Comb. 15(1/2), 71–89 (2010)
3. Brzozowski, J.A.: In search of the most complex regular languages. Int. J. Found. Comput. Sc. 24(6), 691–708 (2013)
4. Brzozowski, J.A., Jirásková, G., Li, B.: Quotient complexity of ideal languages. Theoret. Comput. Sci. 470, 36–52 (2013)
5. Brzozowski, J.A., Jirásková, G., Zou, C.: Quotient complexity of closed languages. Theory Comput. Syst. 54, 277–292 (2014)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Operational Complexity: NFA-to-DFA Trade-Off;Descriptional Complexity of Formal Systems;2023
2. Decision Problems for Three Subclasses of Regular Languages;Advances in Intelligent Systems and Computing;2020-11-18
3. Most Complex Non-Returning Regular Languages;International Journal of Foundations of Computer Science;2019-09
4. The Syntactic Complexity of Semi-flower Languages;Descriptional Complexity of Formal Systems;2019