Publisher
Springer International Publishing
Reference29 articles.
1. Aho, A.V.: Algorithms for finding patterns in strings. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Algorithms and Complexity, vol. A, chap. 5, pp. 257–300. MIT Press, Oxford (1990)
2. Amir, A., Nor, I.: Generalized function matching. J. Disc. Algorithms 5(3), 514–523 (2007)
3. Angluin, D.: Finding patterns common to a set of strings. J. Comput. Syst. Sci. 21, 46–62 (1980)
4. Angluin, D.: Inductive inference of formal languages from positive data. Inf. Control 45(2), 117–135 (1980)
5. Angluin, D., Aspnes, J., Eisenstat, S., Kontorovich, A.: On the learnability of shuffle ideals. J. Mach. Learn. Res. 14, 1513–1531 (2013)