scientific article; zbMATH DE number 3569815
From MaRDI portal
Publication:4140367
zbMATH Open0365.68032MaRDI QIDQ4140367FDOQ4140367
Publication date: 1976
Title of this publication is not available (Why is that?)
Formal languages and automata (68Q45) Algorithms in computer science (68W99) Turing machines and related notions (03D10)
Cited In (9)
- Palindromic decompositions with gaps and errors
- Palindromic subsequence automata and longest common palindromic subsequence
- Steady-paced-output and fractional-on-line algorithms on a RAM
- Counting Palindromes in Substrings
- Palindromic Decompositions with Gaps and Errors
- Finding all the palindromes in a binary tree in linear time and space
- Tight tradeoffs for real-time approximation of longest palindromes in streams
- Efficient computation of maximal anti-exponent in palindrome-free strings
- Iterative arrays with direct central control
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4140367)
