:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Horiyama, Takashi, Numata, Yasuhide, Seto, Kazuhisa, Tsujie, Shuhei
Format:	Preprint
Published:	2026
Subjects:	Combinatorics Formal Languages and Automata Theory 11B39, 68R15, 05A05
Online Access:	https://arxiv.org/abs/2606.02071
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Note on the Relation between Recognisable Series and Regular Sequences, and their Minimal Linear Representations
by: Heuberger, Clemens, et al.
Published: (2022)

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

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

Combinatorics on words and generating Dirichlet series of automatic sequences
by: Allouche, Jean-Paul, et al.
Published: (2024)

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

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

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

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

A note on the power sums of the number of Fibonacci partitions
by: Sanna, Carlo
Published: (2023)

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

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

The speed of convergence in greedy Galois games
by: Shallit, Jeffrey
Published: (2026)

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)

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

A Fibonacci analogue of the two's complement numeration system
by: Labbé, Sébastien, et al.
Published: (2022)

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

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

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

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

Symbols frequencies in the Thue--Morse word in base $3/2$ and related conjectures
by: Cassaigne, Julien, et al.
Published: (2026)

Structure and growth of $\mathbb{R}$-bonacci words
by: Dovgal, Sergey, et al.
Published: (2023)

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

Combinatorics of nondeterministic walks
by: de Panafieu, Élie, et al.
Published: (2023)

The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable
by: Nowotka, Dirk, et al.
Published: (2024)

An Analysis of Decision Problems for Relational Pattern Languages under Various Constraints
by: Jansen, Klaus, et al.
Published: (2025)

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

The Equivalence Problem of E-Pattern Languages with Length Constraints is Undecidable
by: Nowotka, Dirk, et al.
Published: (2024)

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

Applications of Combinatorics on Words with Symbolic Dynamics
by: Abdullah, Duaa, et al.
Published: (2025)

The decidability of the genus of regular languages and directed emulators
by: Bonfante, Guillaume, et al.
Published: (2021)

An automata-based test for bricks over string algebras
by: Kuber, Amit, et al.
Published: (2026)

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

Tight Bounds for the Number of Absent Subsequences
by: Adamson, Duncan, et al.
Published: (2024)

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

Cellular Automaton Reducibility as a Measure of Complexity for Infinite Words
by: Zubia, Markel, et al.
Published: (2026)

The generating power of weighted tree automata with initial algebra semantics
by: Droste, Manfred, et al.
Published: (2024)