Publisher
Springer International Publishing
Reference20 articles.
1. Brzozowski, J.A., Davies, S., Liu, B.Y.V.: Most complex regular ideal languages. Discrete Math. Theoret. Comput. Sci. 18(3) (2016), paper #15
2. Brzozowski, J.A., Jirásková, G., Zou, C.: Quotient complexity of closed languages. Theory Comput. Syst. 54, 277–292 (2014)
3. Brzozowski, J.A.: In search of most complex regular languages. Int. J. Found. Comput. Sci. 24(06), 691–708 (2013)
4. Lecture Notes in Computer Science;J Brzozowski,2016
5. Lecture Notes in Computer Science;JA Brzozowski,2017
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Most Complex Non-Returning Regular Languages;International Journal of Foundations of Computer Science;2019-09
2. Most Complex Deterministic Union-Free Regular Languages;Descriptional Complexity of Formal Systems;2018