The derivation of on-line algorithms, with an application to finding palindromes (1994)
| Venue: | Algorithmica |
| Citations: | 5 - 1 self |
BibTeX
@ARTICLE{Jeuring94thederivation,
author = {Johan Jeuring},
title = {The derivation of on-line algorithms, with an application to finding palindromes},
journal = {Algorithmica},
year = {1994},
volume = {11},
pages = {11--2}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. A theory for the derivation of on-line algorithms is presented. The algorithms are derived in the Bird-Meertens calculus for program transformations. This calculus provides a concise functional notation for algorithms, and a few powerful theorems for proving equalities of functions. The theory for the derivation of on-line algorithms is illustrated with the derivation of an algorithm for finding palindromes. An on-line linear-time random access machine (RAM) algorithm for finding the longest palindromic substring in a string is derived, For the purpose of finding the longest palindromic substring, all maximal palindromic substrings are computed. The list of maximal palindromes obtained in the computation of the longest palindrome can be used for other purposes such as finding the largest palindromic rectangle in a matrix and finding the shortest partition of a string into palindromes. Key Words. Derivation of on-line algorithms, Transformational programming, Bird-Meertens calcu-
