Testing string superprimitivity in parallel - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1993

Testing string superprimitivity in parallel


A string w convers another string z if every symbol of z is within some occurrence of w in z. A string is called superprimitive if it is covered only by itself and quasiperiodic if it is covered by some shorter string. This paper presents an optimal [??] time CRCW-PRAM algorithm that tests if a string z is superprimitive, where [??] is the inverse of the Ackermann function. An alternative implementation takes [??] processors, and is the fastedt possible with this number of processors over a general alphabet.


Other [cs.OH]
Fichier principal
Vignette du fichier
RT-0160.pdf (502.21 Ko) Télécharger le fichier

Dates and versions

inria-00070009 , version 1 (19-05-2006)


  • HAL Id : inria-00070009 , version 1


Dany Breslauer. Testing string superprimitivity in parallel. [Research Report] RT-0160, INRIA. 1993, pp.8. ⟨inria-00070009⟩
88 View
154 Download


Gmail Facebook Twitter LinkedIn More