Real-time recognition of substring repetition and reversal

DOI10.1007/BF01768472zbMath0349.68035OpenAlexW1985572507MaRDI QIDQ4120141

Joel I. Seiferas, Zvi Galil

Publication date: 1977

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01768472

Mathematics Subject Classification ID

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

Related Items (5)

Simple real-time constant-space string matching ⋮ A simplified proof of the real-time recognizability of palindromes on Turing machines ⋮ Simple Real-Time Constant-Space String Matching ⋮ Detecting leftmost maximal periodicities ⋮ Time-space-optimal string matching

Cites Work

• Unnamed Item
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Palindrome recognition in real time by a multitape Turing machine
• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• Fast Pattern Matching in Strings
• Uniqueness Theorems for Periodic Functions
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
• On the Minimum Computation Time of Functions
• Real-Time Simulation of Multihead Tape Units

This page was built for publication: Real-time recognition of substring repetition and reversal