Knuth–Morris–Pratt illustrated

Guardado en:
Detalles Bibliográficos
Publicado en:Journal of Functional Programming vol. 34 (Jan 2024)
Autor principal: Moy, Cameron
Publicado:
Cambridge University Press
Materias:
Acceso en línea:Citation/Abstract
Full Text - PDF
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Descripción
Resumen:The Knuth–Morris–Pratt (KMP) algorithm for string search is notoriously difficult to understand. Lost in a sea of index arithmetic, most explanations of KMP obscure its essence. This paper constructs KMP incrementally, using pictures to illustrate each step. The end result is easier to comprehend. Additionally, the derivation uses only elementary functional programming techniques.
ISSN:0956-7968
1469-7653
DOI:10.1017/S0956796824000017
Fuente:Advanced Technologies & Aerospace Database