Lazy dynamic-programming can be eager
References (11)
An algorithm for the distance between two finite sequences
J. Combin. Theory
(1974)Circular programs and self-referential structure
Software - Practice and Experience
(1989)- et al.
Lazy ML user's manual
Using circular programs to eliminate multiple traversals of data
Acta Inform.
(1984)
There are more references available in the full text version of this article.
Cited by (15)
Efficient parallel and incremental parsing of practical context-free languages
2015, Journal of Functional ProgrammingAn Analysis of Levenshtein Distance Using Dynamic Programming Method
2023, Lecture Notes in Networks and Systems
Copyright © 1992 Published by Elsevier B.V.