Normal forms of quasiperiodic strings

  title={Normal forms of quasiperiodic strings},
  author={Laurent Mouchard},
  journal={Theor. Comput. Sci.},
  • L. Mouchard
  • Published 28 October 2000
  • Mathematics
  • Theor. Comput. Sci.
Quasiperiods of Infinite Words
A characterisation of the set of infinite strings having a certain word q as quasiperiod via a finite language Pq consisting of prefixes of the quas Piperiod q and it turns out its star root ∗ √ Pq is a suffix code having a bounded delay of decipherability.
Series Quasiperiods , Subword Complexity and the Smallest Pisot Number
A quasiperiod of a finite or infinite string/word is a word whose occurrences cover every part of the string. A word or an infinite string is referred to as quasiperiodic if it has a quasiperiod. It
Determining Sets of Quasiperiods of Infinite Words
A method is introduced to determine the set of quasiperiods of a given right infinite word and this result is extended to a new characterization of standard Sturmian words using a property of their sets of qu asipers.
Minimal critical exponent of quasiperiodic words
Speeding up the detection of evolutive tandem repeats
Descriptional Complexity of Formal Systems: 22nd International Conference, DCFS 2020, Vienna, Austria, August 24–26, 2020, Proceedings
Capacitated automata model possible utilizations of systems with bounded resources, their expressive power in the nondeterministic and deterministic models, closure under classical operations, and the complexity of basic decision problems are studied.
Couverture d'un mot bidimensionnel par un motif chevauchant. (Covering a bidimensional word with an overlapping pattern)
La notion de quasiperiodicite des motsinfinis bidimensionnels,introduite par Apostolico et Ehrenfeucht au debut des annees 1990, etendue aux mots infinis par Solomon Marcus, est introduit en 2006.
On the Generative Power of Quasiperiods


An Optimal Algorithm to Compute all the Covers of a String
Covering a String
AnO(n logn)-time algorithm for finding all the seeds of a given string of lengthn is presented and the concept of repetitiveness is generalized as follows.
Testing String Superprimitivity in Parallel
Fast Pattern Matching in Strings
An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum of the lengths of the strings, showing that the set of concatenations of even palindromes, i.e., the language $\{\alpha \alpha ^R\}^*$, can be recognized in linear time.
An On-Line String Superprimitivity Test
Optimal Superprimitivity Testing for Strings
The Smallest Automaton Recognizing the Subwords of a Text
The subtree max gap problem with application to parallel string covering
The algorithm for the subtree max gap problem follows a series of reductions to other combinatorial problems which are interesting on their own merit, and runs in O(log n) time using n processors on the concurrent-read exclusive-write parallel random access machine.