scientific article; zbMATH DE number 3569815
From MaRDI portal
Publication:4140367
zbMath0365.68032MaRDI QIDQ4140367
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Turing machines and related notions (03D10) Algorithms in computer science (68W99)
Related Items (9)
Palindromic subsequence automata and longest common palindromic subsequence ⋮ Palindromic decompositions with gaps and errors ⋮ Steady-paced-output and fractional-on-line algorithms on a RAM ⋮ Palindromic Decompositions with Gaps and Errors ⋮ Counting Palindromes in Substrings ⋮ Efficient computation of maximal anti-exponent in palindrome-free strings ⋮ Finding all the palindromes in a binary tree in linear time and space ⋮ Iterative arrays with direct central control ⋮ Tight tradeoffs for real-time approximation of longest palindromes in streams
This page was built for publication:
