Imagen de Portada

Jumbled Scattered Factors

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Fleischmann, Pamela, Huch, Annika, Kammholz, Melf, Koß, Tore
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics Formal Languages and Automata Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

(Sets of ) Complement Scattered Factors
por: Adamson, Duncan, et al.
Publicado: (2026)

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

$k$-Universality of Regular Languages Revisited
por: Adamson, Duncan, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

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

Half-flips are 5-avoidable
por: Ochem, Pascal
Publicado: (2026)

Absent Subsequences in Words
por: Kosche, Maria, et al.
Publicado: (2021)

Subsequences in Bounded Ranges: Matching and Analysis Problems
por: Kosche, Maria, et al.
Publicado: (2022)

On asymptotically automatic sequences
por: Konieczny, Jakub
Publicado: (2023)

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

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

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

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

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

String Attractors for Automatic Sequences
por: Schaeffer, Luke, et al.
Publicado: (2020)

Some Fibonacci-Related Sequences
por: Cloitre, Benoit, et al.
Publicado: (2023)

Runs in Paperfolding Sequences
por: Shallit, Jeffrey
Publicado: (2024)

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

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

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

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

Some Remarks on Palindromic Periodicities
por: Fici, Gabriele, et al.
Publicado: (2024)

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

On shortest products for nonnegative matrix mortality
por: Ryzhikov, Andrew
Publicado: (2024)

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

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

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

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

Ten Squares Force an Overlap
por: Shallit, Jeffrey
Publicado: (2026)

Antisquares and Critical Exponents
por: Baranwal, Aseem, et al.
Publicado: (2022)

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

Strongly k-recursive sequences
por: Krenn, Daniel, et al.
Publicado: (2024)

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