Cover Image

Reduced complexities for sequences over finite alphabets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Campbell, John M., Currie, James, Rampersad, Narad
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Formal Languages and Automata Theory 11B85
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Antisquares and Critical Exponents
by: Baranwal, Aseem, et al.
Published: (2022)

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

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

Opacity complexity of automatic sequences. The general case
by: Allouche, J. -P., et al.
Published: (2024)

The complexity of finite smooth words over binary alphabets
by: Cassaigne, Julien, et al.
Published: (2026)

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

Runs, Squares, Palindromes, and Unbordered Factors of a Family of Binary Pattern Sequences with the All-One Pattern
by: Hendel, Russell Jay
Published: (2025)

Mahler equations for Zeckendorf numeration
by: Carton, Olivier, et al.
Published: (2024)

Repetition Threshold for Binary Automatic Sequences
by: Allouche, J. -P., et al.
Published: (2024)

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

Arithmetical subword complexity of automatic sequences
by: Konieczny, Jakub, et al.
Published: (2023)

On a sequence of Kimberling and its relationship to the Tribonacci word
by: Dvořáková, Lubomíra, et al.
Published: (2025)

A pumping-like lemma for languages over infinite alphabets
by: Danieli, Yoav
Published: (2025)

Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields
by: Bell, Jason P., et al.
Published: (2022)

Monochromatic arithmetic progressions in the Fibonacci, Thue-Morse, and Rudin-Shapiro words
by: Joshi, Gandhar, et al.
Published: (2025)

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

On asymptotically automatic sequences
by: Konieczny, Jakub
Published: (2023)

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

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

Automaticity of spacetime diagrams generated by cellular automata on commutative monoids
by: Nesme, Vincent
Published: (2022)

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

Jumbled Scattered Factors
by: Fleischmann, Pamela, et al.
Published: (2025)

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

Maximal 2-dimensional binary words of bounded degree
by: Massé, Alexandre Blondin, et al.
Published: (2025)

On the transversals of Latin squares generated by nonlinear bipermutive cellular automata
by: Dennunzio, Alberto, et al.
Published: (2026)

$2$-word-$π$-representable Graphs
by: Adamson, Duncan, et al.
Published: (2026)

Synchronization of strongly connected partial DFAs and prefix codes
by: Berlinkov, Mikhail V., et al.
Published: (2021)

From the Lyndon factorization to the Canonical Inverse Lyndon factorization: back and forth
by: Bonizzoni, Paola, et al.
Published: (2024)

Watson-Crick conjugates of words and languages
by: Mahalingam, Kalpana, et al.
Published: (2022)

Half-flips are 5-avoidable
by: Ochem, Pascal
Published: (2026)

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

The complexity of reachability problems in strongly connected finite automata
by: Kiefer, Stefan, et al.
Published: (2025)

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

Cobham's theorem for the Gaussian integers
by: Bustos-Gajardo, Álvaro, et al.
Published: (2025)

An elementary proof of Bridy's theorem
by: Rowland, Eric, et al.
Published: (2023)

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

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