1. Lecture Notes in Computer Science;L Barker,2020
2. Bojańczyk, M., Segoufin, L., Straubing, H.: Piecewise testable tree languages. Logical Meth. Comp. Science 8(3) (2012)
3. Lecture Notes in Computer Science;O Carton,2018
4. Day, J.D., Fleischmann, P., Kosche, M., Koß, T., Manea, F., Siemer, S.: The edit distance to $$k$$-subsequence universality. In: Proceedings of 38th International Symposium Theoretical Aspects of Computer Science (STACS 2021), vol. 187. LIPiCS, pp. 25:1–25:19. Leibniz-Zentrum für Informatik (2021)
5. Diekert, V., Gastin, P., Kufleitner, M.: A survey on small fragments of first-order logic over finite words. Int. J. Foundat. Comput. Sci. 19(3), 513–548 (2008)