Algorithmic combinatorics on partial words
F Blanchet-Sadri - International Journal of Foundations of Computer …, 2012 - World Scientific
Algorithmic combinatorics on partial words, or sequences of symbols over a finite alphabet
that may have some do-not-know symbols or holes, has been develo** in the past few …
that may have some do-not-know symbols or holes, has been develo** in the past few …
Recurrent partial words
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called
holes, which match or are compatible with all letters; partial words without holes are said to …
holes, which match or are compatible with all letters; partial words without holes are said to …
A note on constructing infinite binary words with polynomial subword complexity∗
F Blanchet-Sadri, B Chen, S Munteanu - … -Theoretical Informatics and …, 2013 - cambridge.org
Most of the constructions of infinite words having polynomial subword complexity are quite
complicated, eg, sequences of Toeplitz, sequences defined by billiards in the cube, etc. In …
complicated, eg, sequences of Toeplitz, sequences defined by billiards in the cube, etc. In …
Rekurentu vārdu struktūra: noturība un tuvības mērs
R Bēts - 2016 - dspace.lu.lv
Disertācijā tiek piedāvāts aperiodiska gadījuma skaitļu filtrācijas ģenerators. Šajā
ģeneratorā filtra virknes vietā tiek izmantots galīgi ģenerēts bi-ideāls. Disertācijā dota …
ģeneratorā filtra virknes vietā tiek izmantots galīgi ģenerēts bi-ideāls. Disertācijā dota …