Cover Image

The speed of convergence in greedy Galois games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Shallit, Jeffrey
Format:	Preprint
Published:	2026
Subjects:	Formal Languages and Automata Theory Discrete Mathematics Combinatorics Probability Primary 11B85, Secondary 68R15, 05A15, 91A60
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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)

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

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

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

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

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

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

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

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

Runs in Paperfolding Sequences
by: Shallit, Jeffrey
Published: (2024)

Ten Squares Force an Overlap
by: Shallit, Jeffrey
Published: (2026)

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)

Multiple consecutive runs of multi-state trials: distributions of $(k_1, k_2, \dots, k_\ell)$ patterns
by: Kong, Yong
Published: (2024)

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

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

String Attractors for Automatic Sequences
by: Schaeffer, Luke, et al.
Published: (2020)

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

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

Practical Livelock Analysis in Parameterized Unidirectional Rings
by: Farahat, Aly
Published: (2026)

Self-Verifying Predicates in Büchi Arithmetic
by: Khodier, Mazen, et al.
Published: (2025)

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

Some Remarks on Palindromic Periodicities
by: Fici, Gabriele, et al.
Published: (2024)

Complexity of Linear Subsequences of Fibonacci-Automatic Sequences
by: Moradi, Delaram, et al.
Published: (2026)

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

Brik's sequence: a strange recursion
by: Shallit, Jeffrey
Published: (2026)

The Hurt-Sada Array and Zeckendorf Representations
by: Shallit, Jeffrey
Published: (2025)

Cloitre's Self-Generating Sequence
by: Shallit, Jeffrey
Published: (2025)

The Narayana Morphism and Related Words
by: Shallit, Jeffrey
Published: (2025)

Lyndon pairs and the lexicographically greatest perfect necklace
by: Becher, Verónica, et al.
Published: (2024)

Pseudoperiodic Words and a Question of Shevelev
by: Meleshko, Joseph, et al.
Published: (2022)

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

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

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