Author:
Caron Pascal,Durand Alexandre,Patrou Bruno
Publisher
Springer Nature Switzerland
Reference14 articles.
1. Mirkin, B.G.: On dual automata. Kibernetica 2(1), 7–10 (1966). http://www.academia.edu/download/46550561/bf0107224720160616-14181-oqti80.pdf
2. Lupanov, O.B.: A comparison of two types of finite automata. Probl. Kibernetiki 9, 321–326 (1963)
3. Maslov, A.N.: Estimates of the number of states of finite automata. Soviet Math. Dokl. 11, 1373–1375 (1970)
4. Krawetz, B., Lawrence, J., Shallit, J.: State complexity and the monoid of transformations of a finite set. Int. J. Found. Comput. Sci. 16(3), 547–563 (2005). https://doi.org/10.1142/S0129054105003157
5. Salomaa, A., Salomaa, K., Yu, S.: State complexity of combined operations. Theor. Comput. Sci. 383(2–3), 140–152 (2007). https://doi.org/10.1016/j.tcs.2007.04.015