Finding patterns common to a set of strings. (English) Zbl 0454.68108


68T10 Pattern recognition, speech recognition
68T99 Artificial intelligence


Full Text: DOI


[1] Aho, A. V.; Hopcroft, J. E.; Ullman, J. D., The Design and Analysis of Computer Algorithms (1974), Addison-Wesley: Addison-Wesley Reading, Mass · Zbl 0286.68029
[3] Angluin, D.; Valiant, L. G., Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. System Sci., 18, 155-193 (1979) · Zbl 0437.05040
[4] Gold, E. M., Complexity of automaton identification from given data, Inform. Contr., 37, 302-320 (1978) · Zbl 0376.68041
[5] Griswold, R. E.; Poage, J. F.; Polonsky, I. P., The SNOBOL4 Programming Language (1972), Prentice-Hall: Prentice-Hall Englewood Cliffs, N.J
[6] Hardy, G. H.; Wright, E. M., An Introduction to the Theory of Numbers (1968), Oxford Univ. Press: Oxford Univ. Press London · Zbl 0020.29201
[7] Hopcroft, J. E.; Ullman, J. D., Formal Languages and Their Relation to Automata (1969), Addison-Wesley: Addison-Wesley Reading, Mass · Zbl 0196.01701
[8] Knuth, D. E.; Morris, J. H.; Pratt, V. R., Fast pattern matching in strings, SIAM J. Comput., 6, 323-350 (1977) · Zbl 0372.68005
[9] Makanin, G. S., The problem of solvability of equations in a free semigroup, Soviet Math. Dokl., 18, 330-334 (1977) · Zbl 0379.20046
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.