Subword complexity and Sturmian colorings of regular trees [PDF]
Dong Han Kim, Seonhee Lim
openalex +1 more source
On the joint subword complexity of automatic sequences
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Convex Geometry of Subword Complexes of Coxeter Groups
Diese Monographie präsentiert Ergebnisse im Zusammenhang mit einer Familie von simplizialen Komplexen, die "Subwortkomplexe" genannt werden. Diese Simplizialkomplexe werden mit Hilfe der Bruhat-Ordnung von Coxeter-Gruppen definiert. Trotz einer einfachen kombinatorischen Definition werden viele ihrer kombinatorischen Eigenschaften immer noch nicht ...
openaire +1 more source
On the state complexity of closures and interiors of regular languages with subwords and superwords [PDF]
Prateek Karandikar +2 more
openalex +2 more sources
The Subword Complexity of a Two-Parameter Family of Sequences [PDF]
Aviezri S. Fraenkel +2 more
openalex +1 more source
n-Subword Complexity Measure of DNA Sequences [PDF]
String complexity has many definitions: Kolmogorov complexity [30]; Lempel-Ziv complexity [14] [27]; Linguistic complexity [42], Subword complexity [10] etc. In this thesis we will consider the n-subword complexity studied in [2] and [13]. The n-subword complexity Pw(n) of a genomic sequence w was defined in [13] as the number of distinct factors ...
openaire
The Lattice of Machine Invariant Sets and Subword Complexity [PDF]
Jānis Buļs
openalex +1 more source
A note on constructing infinite binary words with polynomial subword complexity [PDF]
F. Blanchet-Sadri +2 more
openalex +1 more source
The Subword Complexity of k-Automatic Sequences is k-Synchronized [PDF]
Daniel Goč +2 more
openalex
The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages [PDF]
Narad Rampersad +2 more
openalex +1 more source

