Two fast simulations which imply some fast string matching and palindrome-recognition algorithms
From MaRDI portal
Publication:1226857
DOI10.1016/0020-0190(76)90050-8zbMath0328.68047MaRDI QIDQ1226857
Publication date: 1976
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(76)90050-8
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
03D10: Turing machines and related notions
68W99: Algorithms in computer science
Related Items
Parallel detection of all palindromes in a string, Minimizing access pointers into trees and arrays, On linear context-free languages and one-way multihead automata, On time versus space. II, Finding all the palindromes in a binary tree in linear time and space, Palindrome recognition in real time by a multitape Turing machine, The derivation of on-line algorithms, with an application to finding palindromes, The complexity of on-line simulations between multidimensional turing machines and random access machines
Cites Work