Image de couverture de livre

Mapping words to powers by morphisms

Fuente: arXiv

Enregistré dans:

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

Documents similaires

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

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

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

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

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

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

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

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

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

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

Words with factor complexity $2n+1$ and minimal critical exponent
par: Currie, James D.
Publié: (2025)

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

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

Restivo Salemi property for $α$-power free languages with $α\geq 5$ and $k\geq 3$ letters
par: Rukavicka, Josef
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)

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

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

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

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

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

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

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

$2$-word-$π$-representable Graphs
par: Adamson, Duncan, et autres
Publié: (2026)

Watson-Crick conjugates of words and languages
par: Mahalingam, Kalpana, et autres
Publié: (2022)

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

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

Maximal 2-dimensional binary words of bounded degree
par: Massé, Alexandre Blondin, et autres
Publié: (2025)

On a sequence of Kimberling and its relationship to the Tribonacci word
par: Dvořáková, Lubomíra, et autres
Publié: (2025)

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

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

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

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

Asymptotic bounds for the number of closed and privileged words
par: Gabric, Daniel
Publié: (2022)

Maximizing entropy for power-free languages
par: Climenhaga, Vaughn
Publié: (2025)

The complexity of finite smooth words over binary alphabets
par: Cassaigne, Julien, et autres
Publié: (2026)

On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages
par: Yordzhev, Krasimir
Publié: (2026)

Combinatorics on words and generating Dirichlet series of automatic sequences
par: Allouche, Jean-Paul, et autres
Publié: (2024)

Jumbled Scattered Factors
par: Fleischmann, Pamela, et autres
Publié: (2025)