1. Amarilli, A., Paperman, C.: Topological sorting with regular constraints. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) ICALP 2018, July 9–13, 2018, Prague, Czech Republic. LIPIcs, vol. 107, pp. 115:1–115:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
2. Berlinkov, M.V., Ferens, R., Szykula, M.: Preimage problems for deterministic finite automata. J. Comput. Syst. Sci. 115, 214–234 (2021)
3. Blondin, M., Krebs, A., McKenzie, P.: The complexity of intersecting finite automata having few final states. Comput. Complex. 25(4), 775–814 (2014). https://doi.org/10.1007/s00037-014-0089-9
4. Bruchertseifer, J., Fernau, H.: Synchronizing series-parallel automata with loops. In: Freund, R., Holzer, M., Sempere, J.M. (eds.) NCMA 2019, Valencia, Spain, July 2–3, 2019, pp. 63–78. Österreichische Computer Gesellschaft (2019)
5. Lecture Notes in Computer Science;J Bruchertseifer,2020