A Linear-Time On-Line Recognition Algorithm for ``Palstar

DOI10.1145/322047.322056MaRDI QIDQ4140392zbMATH OpenOpenAlexWikidataFDO

Authors Joel I. Seiferas, Zvi Galil

Publication date 1978

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322047.322056

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Cited in

(18)

• Steady-paced-output and fractional-on-line algorithms on a RAM
• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
• The derivation of on-line algorithms, with an application to finding palindromes
• Finding maximal 2-dimensional palindromes
• Detecting leftmost maximal periodicities
• Tight tradeoffs for real-time approximation of longest palindromes in streams
• Palindromic decompositions with gaps and errors
• Counting the palstars
• scientific article; zbMATH DE number 7559452 (Why is no real title available?)
• Detecting one-variable patterns
• Counting palindromes in substrings
• Palindromic decompositions with gaps and errors
• Finding palindromes: variants and algorithms
• Maximal degenerate palindromes with gaps and mismatches
• Parallel detection of all palindromes in a string
• Double-ended palindromic trees in linear time
• Small space encoding and recognition of k-palindromic prefixes
• Palindromic rich words and run-length encodings

This page was built for publication: A Linear-Time On-Line Recognition Algorithm for ``Palstar

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