:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Currie, James D.
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Formal Languages and Automata Theory 68R15 G.2.1
Online Access:	https://arxiv.org/abs/2507.09387
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

The Shortest Interesting Binary Words
by: Fici, Gabriele
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)

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

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

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

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

Dorst-Smeulders Coding for Arbitrary Binary Words
by: De Luca, Alessandro, et al.
Published: (2025)

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

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

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

Walking on Words
by: Pratt-Hartmann, Ian
Published: (2022)

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

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

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

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

The reflection complexity of sequences over finite alphabets
by: Allouche, Jean-Paul, 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)

Deciding Conjugacy of a Rational Relation
by: Aiswarya, C., et al.
Published: (2023)

Finding codes on infinite grids automatically
by: Salo, Ville, et al.
Published: (2023)

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

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

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

On gapped repeats in a cyclic Fibonacci word
by: Horiyama, Takashi, et al.
Published: (2026)

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)

Stringological sequence prediction I: efficient algorithms for predicting highly repetitive sequences
by: Kosoy, Vanessa
Published: (2026)

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

A cornering strategy for synchronizing a DFA
by: Bradshaw, Peter, et al.
Published: (2024)

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

On a Generalization of the Christoffel Tree: Epichristoffel Trees
by: Krishnamoorthy, Abhishek, et al.
Published: (2025)

Word-Representable Graphs and Locality of Words
by: Böll, Philipp, et al.
Published: (2025)

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

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

Reduced complexities for sequences over finite alphabets
by: Campbell, John M., et al.
Published: (2025)

A generalization of Deterministic Finite Automata related to discharging
by: Campbell, John M.
Published: (2025)

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