Author:
Bell Jason,Brzozowski Janusz,Moreira Nelma,Reis Rogério
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Brzozowski, J.: Quotient complexity of regular languages. J. Autom. Lang. Comb. 15(1/2), 71–89 (2010)
2. Brzozowski, J.: In search of the most complex regular languages. Int. J. Found. Comput. Sc. 24(6), 691–708 (2013)
3. Brzozowski, J., Davies, G.: Maximally atomic languages. In: Ésik, Z., Fülop, Z. (eds.) 14th International Conference Automata and Formal Languages, AFL 2014, Szeged, Hungary, May 27-29. EPTCS, vol. 151, pp. 151–161 (2014)
4. Brzozowski, J., Davies, G.: Most complex regular right-ideal languages. In: 16th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2014, Turku, Finland, August 5-8. LNCS (to appear, 2014)
5. Brzozowski, J., Tamm, H.: Complexity of atoms of regular languages. Int. J. Found. Comput. Sc. 24(7), 1009–1027 (2013)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hot Current Topics of Descriptional Complexity;IFIP Advances in Information and Communication Technology;2021
2. Most Complex Non-Returning Regular Languages;International Journal of Foundations of Computer Science;2019-09
3. Primitivity, Uniform Minimality, and State Complexity of Boolean Operations;Theory of Computing Systems;2018-03-26
4. Most Complex Deterministic Union-Free Regular Languages;Descriptional Complexity of Formal Systems;2018
5. Most Complex Non-returning Regular Languages;Descriptional Complexity of Formal Systems;2017