:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Ochem, Pascal
Format:	Preprint
Published:	2026
Subjects:	Combinatorics Formal Languages and Automata Theory
Online Access:	https://arxiv.org/abs/2605.18811
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Low complexity binary words avoiding $(5/2)^+$-powers
by: Currie, James, 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)

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

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)

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

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

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

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

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

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

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

The Smallest String Attractors of Fibonacci and Period-Doubling Words
by: Banbara, Mutsunori, et al.
Published: (2026)

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

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

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

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)

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

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

Careful synchronisation and the diameter of transformation semigroups with few generators
by: Ryzhikov, Andrew
Published: (2025)

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

Asymptotic bounds for the number of closed and privileged words
by: Gabric, Daniel
Published: (2022)

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

Linear Recurrence Sequence Automata and the Addition of Abstract Numeration Systems
by: Carton, Olivier, et al.
Published: (2024)

On shortest products for nonnegative matrix mortality
by: Ryzhikov, Andrew
Published: (2024)

$x$ Plays Pokemon, for Almost-Every $x$
by: Hedges, C. Evans
Published: (2025)

Automatic Abelian Complexities of Parikh-Collinear Fixed Points
by: Rigo, Michel, et al.
Published: (2024)

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

A Language-Theoretic Approach to the Heapability of Signed Permutations
by: Istrate, Gabriel
Published: (2024)

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

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

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

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

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