The derivation of on-line algorithms, with an application to finding palindromes

  title={The derivation of on-line algorithms, with an application to finding palindromes},
  author={Johan Jeuring},
  • J. Jeuring
  • Published 1 February 1994
  • Mathematics
  • Algorithmica
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… 
Finding Palindromes: Variants and Algorithms
  • J. Jeuring
  • Computer Science, Mathematics
    The Beauty of Functional Code
  • 2013
Several predicates that represent variants of the problem of finding palindromes in strings are introduced and properties for palindrome predicates are introduced, and it is shown how some of the predicates can be extended to satisfy the properties that allow us to use an algorithm for finding palINDromes.
Longest Palindromic Substring in Sublinear Time
This work revisits the classic algorithmic problem of computing a longest palidromic substring and devise a simple O ( n log σ/ log n )-time algorithm that works in sublinear time if σ = 2 o (log n ) .
Two problems about calculating the number of palindromes with different numbers of digits
The aim of this work is to obtain two types of regularities for calculating the number of palindromes. The main results of the work are presented by solving two problems. In the first problem
The Combinatorial Expressions and Probability of Random Generation of Binary Palindromic Digit Combinations
  • V. Lyubimov
  • Computer Science, Mathematics
    Mathematics and Statistics
  • 2021
The aim of this paper is to obtain three types of expressions for calculating the probability of implementing palindromic digit combinations on a finite equally possible combination of zeros and
Palindromes in two-dimensional Words
This work investigates the maximum number number of distinct non-empty HV-palindromic sub-arrays in any finite $2$D word, thus, proving the conjecture given by Anisiua et al.
A subquadratic algorithm for minimum palindromic factorization
Topics in combinatorial pattern matching
A lower bound is given on the time-space product for LCE data structures in the non-uniform cell probe model showing that the second trade-off is nearly optimal.
Maximum segment sum is back: deriving algorithms for two segment problems with bounded lengths
It turns out that, while the classical MSS problem is solved by the Greedy Theorem, by applying the Thinning The theorem, one gets a linear-time algorithm for MSS with upper bound on length.
Time-Space Trade-Offs for Longest Common Extensions
The time-space trade-offs for the LCE problem, that is, the space used for the data structure vs. the worst-case time for answering an LCE query, are studied.
Two-dimensional Total Palindrome Complexity
We initiate a comparative study of the properties of total palindrome complexity for binary words and arrays. From this point of view, the HV-palindrome complexity for arrays seems to be more


A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
The present algorithm, based on the Knuth-Morris-Prat algorithm, solves the problem of recognizing the initial leftmost nonvoid palindrome of a string in time proportional to the length N of thePalindrome, and an extension allows one to recognize the initial odd or even palindromes of length 2 or greater.
Fast Pattern Matching in Strings
An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum of the lengths of the strings, showing that the set of concatenations of even palindromes, i.e., the language $\{\alpha \alpha ^R\}^*$, can be recognized in linear time.
Combinatorial Algorithms on Words
The average-case Cost of the Brute force and the Knuth-Morris-Pratt String Matching Algorithm are compared and the Mellin integral Transform in the Analysis of Algorithms is compared.
Law and order in algorithmics
An algorithm is the input-output effect of a computer program; mathematically, the notion of algorithm comes close to the notion of function. Just as arithmetic is the theory and practice of
Parallel Computations on Strings and Arrays
We present several new parallel algorithms in the field of string and array processing. We give almost optimal algorithms for pattern matching in arrays and for related problem: longest common
By exploiting the formal similarity of string-matching with integer multiplication, a new algorithm has been obtained with a running time which is only slightly worse than linear.
Linear Pattern Matching Algorithms
A linear time algorithm for obtaining a compacted version of a bi-tree associated with a given string is presented and indicated how to solve several pattern matching problems, including some from [4] in linear time.
Real-time algorithms for string-matching and palindrome recognition
This work uses a sufficient condition when an on-line algorithm can be transformed into a real-time algorithm to construct real- time algorithms for string-matching and palindrome recognition problems by random access machines and by Turing machines.
A Linear-Time On-Line Recognition Algorithm for ``Palstar''
A hneartime on-hne recogmtmn algorithm is presented for P~ ("palstar") on a random-access machine with addmon and umform cost criterion and a recognition algorithm for Pt 2 on a two-way deterministic pushdown automaton is presented.