Pages that link to "Item:Q1226857"
From MaRDI portal
The following pages link to Two fast simulations which imply some fast string matching and palindrome-recognition algorithms (Q1226857):
Displaying 8 items.
- Parallel detection of all palindromes in a string (Q673783) (← links)
- Minimizing access pointers into trees and arrays (Q795505) (← links)
- On linear context-free languages and one-way multihead automata (Q1061497) (← links)
- On time versus space. II (Q1152954) (← links)
- Finding all the palindromes in a binary tree in linear time and space (Q1201867) (← links)
- Palindrome recognition in real time by a multitape Turing machine (Q1249574) (← links)
- The derivation of on-line algorithms, with an application to finding palindromes (Q1314430) (← links)
- The complexity of on-line simulations between multidimensional turing machines and random access machines (Q4013406) (← links)
