Image de couverture de livre

Words with factor complexity $2n+1$ and minimal critical exponent

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Currie, James D.
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics Formal Languages and Automata Theory 68R15 G.2.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Some Results on Digital Segments and Balanced Words
par: De Luca, Alessandro, et autres
Publié: (2022)

Low complexity binary words avoiding $(5/2)^+$-powers
par: Currie, James, et autres
Publié: (2025)

Tight Bounds for the Number of Absent Subsequences
par: Adamson, Duncan, et autres
Publié: (2024)

The Shortest Interesting Binary Words
par: Fici, Gabriele
Publié: (2024)

Mapped Exponent and Asymptotic Critical Exponent of Words
par: Foster, Eva, et autres
Publié: (2025)

Group Actions and Some Combinatorics on Words with $\mathbf{vtm}$
par: Machacek, John
Publié: (2025)

A Connection Between Unbordered Partial Words and Sparse Rulers
par: Saarela, Aleksi, et autres
Publié: (2024)

Computing the k-binomial complexity of generalized Thue--Morse words
par: Golafshan, M., et autres
Publié: (2024)

The repetition threshold for ternary rich words
par: Currie, James D., et autres
Publié: (2024)

Digital Convexity and Combinatorics on Words
par: De Luca, Alessandro, et autres
Publié: (2025)

Mapping words to powers by morphisms
par: Saarela, Aleksi
Publié: (2025)

Subword enumeration up to stack-sorting equivalence
par: Campbell, John M., et autres
Publié: (2026)

Dorst-Smeulders Coding for Arbitrary Binary Words
par: De Luca, Alessandro, et autres
Publié: (2025)

Avoiding abelian and additive powers in rich words
par: Andrade, Jonathan, et autres
Publié: (2024)

Deciding Conjugacy of a Rational Relation
par: Aiswarya, C., et autres
Publié: (2023)

Walking on Words
par: Pratt-Hartmann, Ian
Publié: (2022)

Finding codes on infinite grids automatically
par: Salo, Ville, et autres
Publié: (2023)

A Note on the Relation between Recognisable Series and Regular Sequences, and their Minimal Linear Representations
par: Heuberger, Clemens, et autres
Publié: (2022)

An Analysis of Decision Problems for Relational Pattern Languages under Various Constraints
par: Jansen, Klaus, et autres
Publié: (2025)

The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable
par: Nowotka, Dirk, et autres
Publié: (2024)

The Equivalence Problem of E-Pattern Languages with Length Constraints is Undecidable
par: Nowotka, Dirk, et autres
Publié: (2024)

Restivo Salemi property for $α$-power free languages with $α\geq 5$ and $k\geq 3$ letters
par: Rukavicka, Josef
Publié: (2023)

The reflection complexity of sequences over finite alphabets
par: Allouche, Jean-Paul, et autres
Publié: (2024)

From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
par: Khormali, Omid, et autres
Publié: (2026)

Templated Assembly Theory: An Extension of the Canonical Assembly Index with Block-Compressed Template
par: Masierak, Piotr
Publié: (2026)

Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents
par: Peltomäki, Jarkko
Publié: (2021)

On gapped repeats in a cyclic Fibonacci word
par: Horiyama, Takashi, et autres
Publié: (2026)

On a Generalization of the Christoffel Tree: Epichristoffel Trees
par: Krishnamoorthy, Abhishek, et autres
Publié: (2025)

The decidability of the genus of regular languages and directed emulators
par: Bonfante, Guillaume, et autres
Publié: (2021)

Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences
par: Couvreur, Jean-Michel, et autres
Publié: (2025)

Introducing q-deformed binomial coefficients of words
par: Renard, Antoine, et autres
Publié: (2024)

Stringological sequence prediction I: efficient algorithms for predicting highly repetitive sequences
par: Kosoy, Vanessa
Publié: (2026)

Word-Representable Graphs and Locality of Words
par: Böll, Philipp, et autres
Publié: (2025)

A cornering strategy for synchronizing a DFA
par: Bradshaw, Peter, et autres
Publié: (2024)

Cellular Automaton Reducibility as a Measure of Complexity for Infinite Words
par: Zubia, Markel, et autres
Publié: (2026)

Reduced complexities for sequences over finite alphabets
par: Campbell, John M., et autres
Publié: (2025)

A generalization of Deterministic Finite Automata related to discharging
par: Campbell, John M.
Publié: (2025)

Clustering of return words in languages of interval exchanges
par: Dolce, Francesco, et autres
Publié: (2025)

From the Lyndon factorization to the Canonical Inverse Lyndon factorization: back and forth
par: Bonizzoni, Paola, et autres
Publié: (2024)

Positionality of Dumont--Thomas numeration systems for integers
par: Kreczman, Savinien, et autres
Publié: (2025)