scientific article
From MaRDI portal
Publication:3355232
zbMath0729.68024MaRDI QIDQ3355232
Maxime Crochemore, Wojciech Rytter
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
PRAMbuilding pattern matching automatacomputing Lyndon factorizationsfinding squareslongest commonlongest repeated subarraylongest symmetric subarraypattern matching in arraystesting even
Related Items
On two-dimensional pattern matching by optimal parallel algorithms ⋮ Parallel construction of minimal suffix and factor automata ⋮ Efficient parallel algorithms to test square-freeness and factorize strings ⋮ Efficient constructions of test sets for regular and context-free languages ⋮ The derivation of on-line algorithms, with an application to finding palindromes