Cover Image

Restivo Salemi property for $α$-power free languages with $α\geq 5$ and $k\geq 3$ letters

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Rukavicka, Josef
Format:	Preprint
Published:	2023
Subjects:	Formal Languages and Automata Theory Discrete Mathematics 68R15
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Dissecting power of intersection of two context-free languages
by: Rukavicka, Josef
Published: (2020)

Avoiding abelian and additive powers in rich words
by: Andrade, Jonathan, et al.
Published: (2024)

The repetition threshold for ternary rich words
by: Currie, James D., et al.
Published: (2024)

Digital Convexity and Combinatorics on Words
by: De Luca, Alessandro, et al.
Published: (2025)

Clustering of return words in languages of interval exchanges
by: Dolce, Francesco, et al.
Published: (2025)

Some Results on Digital Segments and Balanced Words
by: De Luca, Alessandro, et al.
Published: (2022)

Note on dissecting power of regular languages
by: Rukavicka, Josef
Published: (2023)

From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
by: Khormali, Omid, et al.
Published: (2026)

Maximizing entropy for power-free languages
by: Climenhaga, Vaughn
Published: (2025)

Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences
by: Couvreur, Jean-Michel, et al.
Published: (2025)

Introducing q-deformed binomial coefficients of words
by: Renard, Antoine, et al.
Published: (2024)

Low complexity binary words avoiding $(5/2)^+$-powers
by: Currie, James, et al.
Published: (2025)

The reflection complexity of sequences over finite alphabets
by: Allouche, Jean-Paul, et al.
Published: (2024)

Mapping words to powers by morphisms
by: Saarela, Aleksi
Published: (2025)

Computing the k-binomial complexity of generalized Thue--Morse words
by: Golafshan, M., et al.
Published: (2024)

Strongly k-recursive sequences
by: Krenn, Daniel, et al.
Published: (2024)

Banach density of generated languages: Dichotomies in topology and dimension
by: Kleinberg, Jon, et al.
Published: (2026)

Extended branching Rauzy induction
by: Dolce, Francesco, et al.
Published: (2025)

Modular Decomposition of Hierarchical Finite State Machines
by: Biggar, Oliver, et al.
Published: (2021)

Decidability and Characterization of Expansivity for Group Cellular Automata
by: Castronuovo, Niccolo', et al.
Published: (2025)

Algebraic Characterization of Reversible First Degree Cellular Automata over $\mathbb{Z}_d$
by: J., Baby C., et al.
Published: (2026)

A Divide and Conquer Algorithm for Deciding Group Cellular Automata Dynamics
by: Castronuovo, Niccolo', et al.
Published: (2025)

Persistent Permutability in Choice Petri Nets
by: Best, Eike, et al.
Published: (2026)

A New Notion of Regularity: Finite State Automata Accepting Graphs
by: Meeres, Yvo Ad
Published: (2024)

Counting Polyominoes in a Rectangle b x h
by: Marin, Louis
Published: (2024)

Differential Tree Automata
by: Manssour, Rida Ait El, et al.
Published: (2024)

Self-descriptive Sequences directed by two Periodic Sequences
by: Akiyama, Shigeki, et al.
Published: (2024)

Positionality of Dumont--Thomas numeration systems for integers
by: Kreczman, Savinien, et al.
Published: (2025)

Subword enumeration up to stack-sorting equivalence
by: Campbell, John M., et al.
Published: (2026)

A Connection Between Unbordered Partial Words and Sparse Rulers
by: Saarela, Aleksi, et al.
Published: (2024)

Mapped Exponent and Asymptotic Critical Exponent of Words
by: Foster, Eva, et al.
Published: (2025)

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

The Shortest Interesting Binary Words
by: Fici, Gabriele
Published: (2024)

q-Parikh Matrices and q-deformed binomial coefficients of words
by: Renard, Antoine, et al.
Published: (2024)

Palindromic length of infinite aperiodic words
by: Rukavicka, Josef
Published: (2024)

Subexponential upper bound on the number of rich words
by: Rukavicka, Josef
Published: (2025)

Complexity of Linear Subsequences of $k$-Automatic Sequences
by: Moradi, Delaram, et al.
Published: (2025)

Some Fibonacci-Related Sequences
by: Cloitre, Benoit, et al.
Published: (2023)

Dyck Words, Pattern Avoidance, and Automatic Sequences
by: Mol, Lucas, et al.
Published: (2023)

The Repetition Threshold for Rote Sequences
by: Ollinger, Nicolas, et al.
Published: (2024)