References

  1. J. Brzozowski (1980): Open Problems About Regular Languages. In: R. V. Book: Formal Language Theory. Academic Press, pp. 23–47, doi:10.1016/B978-0-12-115350-2.50007-5.
  2. J. Dassow (2016): On the Number of Accepting States of Finite Automata. J. Autom., Lang. Comb. 21(1–2), pp. 55–67, doi:10.25596/jalc-2016-055.
  3. Y. Gao, N. Moreira, R. Reis & S. Yu (2016): A Survey on Operational State Complexity. J. Autom., Lang. Comb. 21(4), pp. 251–310, doi:10.25596/jalc-2016-251.
  4. M. A. Harrison (1978): Introduction to Formal Language Theory. Addison-Wesley.
  5. M. Holzer & C. Rauch (2021): The Range of State Complexities of Languages Resulting From the Cascade Product—The Unary Case. In: S. Maneth: Proceedings of the 25th International Conference on Implementation and Application of Automata, LNCS 12803. Springer, Bremen, Germany, pp. 90–101, doi:10.1007/978-3-030-79121-6_8.
  6. M. Hospodár & M. Holzer (2018): The Ranges of Accepting State Complexities of Languages Resulting From Some Operations. In: C. Campeanu: Proceedings of the 23th Conference on Implemenation and Application of Automata, LNCS 10977. Springer, Charlottetown, Prince Edward Island, Canada, pp. 198–210, doi:10.1007/978-3-319-94812-6_17.
  7. M. Hospodár & P. Mlynárčik (2020): Operations on Permutation Automata. In: N. Jonoska & D. Savchuk: Proceedings of the 24th International Conference on Developments in Language Theory, LNCS 12086. Springer, Tampa, Florida, USA, pp. 122–136, doi:10.1007/978-3-030-48516-0_10.
  8. K. Iwama, Y. Kambayashi & K. Takaki (2000): Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs. Theoret. Comput. Sci. 237(1–2), pp. 485–494, doi:10.1016/S0304-3975(00)00029-3.
  9. I. Jecker, N. Mazzocchi & P. Wolf (2021): Decomposing Permutation Automata. In: S. Haddad & D. Varacca: Proceedings of the 32nd International Conference on Concurrency Theory, LIPIcs 203. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, Virtual Conference, pp. 18:1–18:19, doi:10.4230/LIPIcs.CONCUR.2021.18.
  10. H. P. Zeiger (1967): Yet Another Proof of the Cascade Decomposition Theorem for Finite Automata. Math. Syst. Theory 1(3), pp. 225–228, doi:10.1007/BF01703821.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org