Palindrome recognition in real time by a multitape Turing machine
From MaRDI portal
Publication:1249574
DOI10.1016/0022-0000(78)90042-9zbMATH Open0386.03020OpenAlexW2012485168MaRDI QIDQ1249574FDOQ1249574
Publication date: 1978
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(78)90042-9
Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)
Cites Work
- On the Computational Complexity of Algorithms
- Title not available (Why is that?)
- Fast Pattern Matching in Strings
- Title not available (Why is that?)
- Title not available (Why is that?)
- String Matching in Real Time
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Real-Time Simulation of Multihead Tape Units
- Two fast simulations which imply some fast string matching and palindrome-recognition algorithms
- Real time computation
- Iterative arrays with direct central control
Cited In (9)
- Counting distinct palindromes in a word in linear time
- Searching for gapped palindromes
- Parallel detection of all palindromes in a string
- Efficient retrieval of approximate palindromes in a run-length encoded string
- The derivation of on-line algorithms, with an application to finding palindromes
- Palindrome recognition using a multidimensional tape.
- Real-time recognition of substring repetition and reversal
- Searching for Gapped Palindromes
- Efficient string matching on packed texts
This page was built for publication: Palindrome recognition in real time by a multitape Turing machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1249574)
