scientific article; zbMATH DE number 2183071

MaRDI QIDQ4681771zbMATH OpenFDO

Authors M. Lothaire

Publication date 27 June 2005

Recommendations

scientific article; zbMATH DE number 1024080
scientific article; zbMATH DE number 1737190
scientific article; zbMATH DE number 2155195
scientific article; zbMATH DE number 3898807
scientific article; zbMATH DE number 3878866
scientific article; zbMATH DE number 2149521
scientific article; zbMATH DE number 2150290
Combinatorics of Compositions and Words
Mini-workshop: Combinatorics on words. Abstracts from the mini-workshop held August 22nd -- August 28th, 2010.
TCS special issue: Combinatorics on words -- WORDS 2015

Cited in

(only showing first 100 items - show all)

On the tiling by translation problem
Repetitions in strings: algorithms and combinatorics
Border correlations, lattices, and the subgraph component polynomial
Computing primitively-rooted squares and runs in partial words
Period recovery of strings over the Hamming and edit distances
On the shortest distance between orbits and the longest common substring problem
On the minimal alphabet size in multidimensional unrepetitive configurations
Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols
On the maximum number of cubic subwords in a word
Inverse Lyndon words and inverse Lyndon factorizations of words
Calculating the numbers of representations and the Garsia entropy in linear numeration systems
On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
The perimeter of words
Fractional meanings of nonrepetitiveness
On the approximation ratio of LZ-end to LZ77
Cut norm discontinuity of triangular truncation of graphons
Gray codes for Fibonacci \(q\)-decreasing words
Clustering genomic words in human DNA using peaks and trends of distributions
Bifix codes and interval exchanges
Characteristic morphisms of generalized episturmian words
An efficient generalized shift-rule for the prefer-max de Bruijn sequence
Moments of the count of a regular expression in a heterogeneous random sequence
Recognizing binary shuffle squares is \textsf{NP}-hard
Wasserstein and Kolmogorov error bounds for variance-gamma approximation via Stein's method. I
The alternating BWT: an algorithmic perspective
Longest property-preserved common factor: a new string-processing framework
Fully-online suffix tree and directed acyclic word graph construction for multiple texts
The operator approach to entropy games
Perspectives: Journal of Discrete Algorithms Special StringMasters Issue (2015)
On a generalization of Thue sequences
A maximal entropy stochastic process for a timed automaton
State complexity of prefix distance
Indeterminate string factorizations and degenerate text transformations
Dynamical directions in numeration
Fractal representation of the attractive lamination of an automorphism of the free group.
Substitutions with cofinal fixed points
Discrete rotations and symbolic dynamics
A note on the number of squares in a word
Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words
On left and right seeds of a string
Existence of finite test-sets for k-power-freeness of uniform morphisms
Succinct 2D dictionary matching
On generalized Lyndon words
The identity problem of finitely generated bi-ideals
Average case analysis of Moore's state minimization algorithm
Compound patterns and generating functions: from basic waiting times to counts of occurrence
On the average number of regularities in a word
Languages with mismatches
Enumeration and generation with a string automata representation
From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
Distributions associated with general runs and patterns in hidden Markov models
On different generalizations of episturmian words
Growth of repetition-free words -- a review
Some characterizations of finite Sturmian words.
Non-uniform random generation of generalized Motzkin paths
Periods in extensions of words
On shuffled-square-free words
On recognising words that are squares for the shuffle product
scientific article; zbMATH DE number 1589555 (Why is no real title available?)
On del-robust primitive words
Some applications of the Schutzenberger-Bertoni method
On the size of transducers for bidirectional decoding of prefix codes
Decidability problems for self-induced systems generated by a substitution
State complexity of prefix distance
Fast circular dictionary-matching algorithm
Stream differential equations: specification formats and solution methods
Efficient seeds computation revisited
On the First k Moments of the Random Count of a Pattern in a Multistate Sequence Generated by a Markov Source
Locally catenative sequences and turtle graphics
Distribution of clump statistics for a collection of words
On digital blocks of polynomial values and extractions in the Rudin-Shapiro sequence
Periodic codings of Bratteli-Vershik systems
Searching and indexing circular patterns
Moderate deviations for word counts in biological sequences
Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain
Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
Sturmian and Episturmian Words
The Average State Complexity of the Star of a Finite Set of Words Is Linear
On a Generalization of Standard Episturmian Morphisms
Bounds on Powers in Strings
Equations on partial words
Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
A linear time and space algorithm for detecting path intersection
scientific article; zbMATH DE number 3913711 (Why is no real title available?)
scientific article; zbMATH DE number 4090830 (Why is no real title available?)
Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source
Efficient seed computation revisited
Enhanced string covering
Suffix array and Lyndon factorization of a text
A note on Sturmian words
scientific article; zbMATH DE number 1737190 (Why is no real title available?)
General framework
A uniform cube-free morphism is k-power-free for all integers k 4
Textual data compression in computational biology: algorithmic techniques
Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without forbidden words
Descriptional complexity of error detection
A look inside the kitchen of combinatorics on infinite words.
\(k\)-abelian pattern matching
Indeterminate strings, prefix arrays \& undirected graphs
Another generalization of abelian equivalence: binomial complexity of infinite words

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4681771)