:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Hedges, C. Evans
Format:	Preprint
Publié:	2025
Sujets:	History and Overview Formal Languages and Automata Theory Combinatorics
Accès en ligne:	https://arxiv.org/abs/2512.23143
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Jumbled Scattered Factors
par: Fleischmann, Pamela, et autres
Publié: (2025)

Word-Representable Graphs and Locality of Words
par: Böll, Philipp, et autres
Publié: (2025)

Maximal 2-dimensional binary words of bounded degree
par: Massé, Alexandre Blondin, et autres
Publié: (2025)

On a sequence of Kimberling and its relationship to the Tribonacci word
par: Dvořáková, Lubomíra, et autres
Publié: (2025)

On the transversals of Latin squares generated by nonlinear bipermutive cellular automata
par: Dennunzio, Alberto, et autres
Publié: (2026)

$2$-word-$π$-representable Graphs
par: Adamson, Duncan, et autres
Publié: (2026)

Synchronization of strongly connected partial DFAs and prefix codes
par: Berlinkov, Mikhail V., et autres
Publié: (2021)

From the Lyndon factorization to the Canonical Inverse Lyndon factorization: back and forth
par: Bonizzoni, Paola, et autres
Publié: (2024)

Watson-Crick conjugates of words and languages
par: Mahalingam, Kalpana, et autres
Publié: (2022)

Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields
par: Bell, Jason P., et autres
Publié: (2022)

Half-flips are 5-avoidable
par: Ochem, Pascal
Publié: (2026)

On asymptotically automatic sequences
par: Konieczny, Jakub
Publié: (2023)

Arithmetical subword complexity of automatic sequences
par: Konieczny, Jakub, et autres
Publié: (2023)

Completely Reachable Almost Group Automata
par: Torres, David Fernando Casas
Publié: (2024)

Self-Verifying Predicates in Büchi Arithmetic
par: Khodier, Mazen, et autres
Publié: (2025)

Careful synchronisation and the diameter of transformation semigroups with few generators
par: Ryzhikov, Andrew
Publié: (2025)

The Repetition Threshold for Rote Sequences
par: Ollinger, Nicolas, et autres
Publié: (2024)

String Attractors for Automatic Sequences
par: Schaeffer, Luke, et autres
Publié: (2020)

Some Fibonacci-Related Sequences
par: Cloitre, Benoit, et autres
Publié: (2023)

Runs in Paperfolding Sequences
par: Shallit, Jeffrey
Publié: (2024)

Dyck Words, Pattern Avoidance, and Automatic Sequences
par: Mol, Lucas, et autres
Publié: (2023)

Asymptotic bounds for the number of closed and privileged words
par: Gabric, Daniel
Publié: (2022)

Pseudoperiodic Words and a Question of Shevelev
par: Meleshko, Joseph, et autres
Publié: (2022)

The complexity of finite smooth words over binary alphabets
par: Cassaigne, Julien, et autres
Publié: (2026)

Some Remarks on Palindromic Periodicities
par: Fici, Gabriele, et autres
Publié: (2024)

Linear Recurrence Sequence Automata and the Addition of Abstract Numeration Systems
par: Carton, Olivier, et autres
Publié: (2024)

On shortest products for nonnegative matrix mortality
par: Ryzhikov, Andrew
Publié: (2024)

The Smallest String Attractors of Fibonacci and Period-Doubling Words
par: Banbara, Mutsunori, et autres
Publié: (2026)

Automatic Abelian Complexities of Parikh-Collinear Fixed Points
par: Rigo, Michel, et autres
Publié: (2024)

Banach density of generated languages: Dichotomies in topology and dimension
par: Kleinberg, Jon, et autres
Publié: (2026)

Repetition Threshold for Binary Automatic Sequences
par: Allouche, J. -P., et autres
Publié: (2024)

Ten Squares Force an Overlap
par: Shallit, Jeffrey
Publié: (2026)

Antisquares and Critical Exponents
par: Baranwal, Aseem, et autres
Publié: (2022)

A Language-Theoretic Approach to the Heapability of Signed Permutations
par: Istrate, Gabriel
Publié: (2024)

Strongly k-recursive sequences
par: Krenn, Daniel, et autres
Publié: (2024)

Complexity of Linear Subsequences of Fibonacci-Automatic Sequences
par: Moradi, Delaram, et autres
Publié: (2026)

Counting Polyominoes in a Rectangle b x h
par: Marin, Louis
Publié: (2024)

A generalization of Deterministic Finite Automata related to discharging
par: Campbell, John M.
Publié: (2025)

Low complexity binary words avoiding $(5/2)^+$-powers
par: Currie, James, et autres
Publié: (2025)

Reduced complexities for sequences over finite alphabets
par: Campbell, John M., et autres
Publié: (2025)