scientific article; zbMATH DE number 3569815

MaRDI QIDQ4140367zbMATH OpenFDO

Authors Zvi Galil

Publication date 1976

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms in computer science (68W99) Turing machines and related notions (03D10)

Cited in

(10)

• Counting palindromes in substrings
• Small-space algorithms for the online language distance problem for palindromes and squares
• Palindromic decompositions with gaps and errors
• Palindromic subsequence automata and longest common palindromic subsequence
• Palindromic decompositions with gaps and errors
• Steady-paced-output and fractional-on-line algorithms on a RAM
• Finding all the palindromes in a binary tree in linear time and space
• Tight tradeoffs for real-time approximation of longest palindromes in streams
• Efficient computation of maximal anti-exponent in palindrome-free strings
• Iterative arrays with direct central control

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4140367)