Words and special factors

DOI10.1016/S0304-3975(99)00334-5zbMath0973.68191MaRDI QIDQ5941274

Aldo De Luca, Arturo Carpi

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00334-5

zbMATH Keywords

bispecial factors; boxes; maximal box theorem; special factors; superboxes

Mathematics Subject Classification ID

68R15: Combinatorics on words

Related Items

On the distribution of characteristic parameters of words, On the distribution of characteristic parameters of words II, The geometric properties of an infinitary line and plane languages, Reverse-Safe Text Indexing, A tight upper bound on the length of maximal bordered box repetition-free words, A linear algorithm for string reconstruction in the reverse complement equivalence model, Special factors and the combinatorics of suffix and factor automata, On a conjecture about finite fixed points of morphisms, Some characterizations of Parikh matrix equivalent binary words, From Nerode's congruence to suffix automata with mismatches, Subword conditions and subword histories, Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. II: Reconstruction with forbidden words, Reconstruction of a word from a multiset of its factors, On highly palindromic words, Words and forbidden factors, A combinatorial property of the factor poset of a word, Semiperiodic words and root-conjugacy., Uniform words, Languages with mismatches, Connections between subwords and certain matrix mappings, Word assembly through minimal forbidden words, Adaptive learning of compressible strings, Efficient Reconstruction of RC-Equivalent Strings, On the Suffix Automaton with Mismatches

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automata and forbidden words
• Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
• Complexity and special factors
• Words and repeated factors
• On the combinatorics of finite words
• On bispecial factors of the Thue-Morse word
• Some combinatorial properties of Sturmian words
• Automaticity. II: Descriptional complexity in the unary case
• On the factors of the Thue-Morse word on three symbols
• Compression of individual sequences via variable-rate coding
• Minimal forbidden words and symbolic dynamics