Publisher
Springer Nature Switzerland
Reference17 articles.
1. Almeida, M., Moreira, N., Reis, R.: Exact generation of minimal acyclic deterministic finite automata. Int. J. Found. Comput. Sci. 19(4), 751–765 (2008). https://doi.org/10.1142/S0129054108005930
2. Almeida, M., Moreira, N., Reis, R.: Finite automata minimization algorithms. In: Wang, J. (ed.) Handbook of Finite State Based Models and Applications, pp. 145–170. CRC Press (2012)
3. Câmpeanu, C., Ho, W.H.: The maximum state complexity for finite languages. J. Autom. Lang. Comb. 9(2–3), 189–202 (2004)
4. Dudzinski, K., Konstantinidis, S.: Formal descriptions of code properties: decidability, complexity, implementation. Int. J. Found. Comput. Sci. 23(1), 67–85 (2012). https://doi.org/10.1142/S0129054112400059
5. Elvey Price, A., Fang, W., Wallner, M.: Compacted binary trees admit a stretched exponential. J. Comb. Theory Ser. A 177, 105306 (2021). https://doi.org/10.1016/J.JCTA.2020.105306
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Operational State Complexity of Block Languages;Electronic Proceedings in Theoretical Computer Science;2024-09-11