×

Periods in strings. (English) Zbl 0464.68070


MSC:

68R99 Discrete mathematics in relation to computer science

Keywords:

string matching
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Boyer, S. B.; Moore, J. S., A fast string searching algorithm, Comm. Assoc. Comput. Mach., 20, 762-771 (1977) · Zbl 1219.68165
[2] Fine, N. J.; Wilf, H. S., Uniqueness theorems for periodic functions, (Proc. Amer. Math. Soc., 16 (1965)), 109-114 · Zbl 0131.30203
[3] Gardner, M., On the paradoxical situations that arise from nontransitive relations, Sci. Amer., 120-125 (October 1974)
[4] Guibas, L. J.; Odlyzko, A. M., A new proof of the linearity of the Boyer-Moore string searching algorithm, (Proceedings, 18th Annual Symposium on Foundations of Computer Science Proceedings (1977), IEEE Computer Society: IEEE Computer Society New York), Revised version SIAM J. Comput., in press · Zbl 0446.68050
[5] L. J. Guibas and A. M. OdlyzkoJ. Combinatorial Theory Ser. A; L. J. Guibas and A. M. OdlyzkoJ. Combinatorial Theory Ser. A · Zbl 0454.68109
[6] Galil, Z.; Seiferas, J., Saving space in fast string matching, (Proceedings, 18th Annual Symposium on Foundations of Computer Science Proceedings (1977), IEEE Computer Society: IEEE Computer Society New York) · Zbl 0446.68041
[7] Harborth, H., Endliche 0-1-Folgen mit gleichen Teilblöcken, Crelle’s J., 271, 139-154 (1974) · Zbl 0297.05008
[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] Lyndon, R. C.; Schützenberger, M. P., The equation \(a^M = b^{N\) · Zbl 0106.02204
[10] Nielsen, T. P., On the expected duration of a search for a fixed pattern in random data, IEEE Trans. Inform Theory, 702-704 (1973) · Zbl 0278.94008
[11] Schützenberger, M. P., A property of finitely generated submonoids of free monoids, (Actes de Colloque sur le semigroups à Szeged (1976), North-Holland: North-Holland Amsterdam), in press · Zbl 0413.20042
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.