Author:
Nowotka Dirk,Wiedenhöft Max
Publisher
Springer Nature Switzerland
Reference25 articles.
1. Angluin, D.: Finding patterns common to a set of strings. J. Comput. Syst. Sci. 21(1), 46–62 (1980)
2. Bremer, J., Freydenberger, D.D.: Inclusion problems for patterns with a bounded number of variables. Inf. Comput. 220–221, 15–43 (2012)
3. Day, J.D., Fleischmann, P., Manea, F., Nowotka, D.: Local patterns. In: Lokam, S., Ramanujam, R. (eds.) FSTTCS 2017. LIPIcs, vol. 93, pp. 24:1–24:14. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany (2018)
4. Ehrenfeucht, A., Rozenberg, G.: Finding a homomorphism between two words is NP-complete. Inf. Process. Lett. 9(2), 86–88 (1979)
5. Fernau, H., Manea, F., Mercaş, R., Schmid, M.L.: Revisiting Shinohara’s algorithm for computing descriptive patterns. TCS 733, 44–54 (2018). special Issue on Learning Theory and Complexity