Imagen de Portada

Word-Representable Graphs and Locality of Words

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Böll, Philipp, Fleischmann, Pamela, Huch, Annika, Kreiß, Jana, Löck, Tim, Park, Kajus, Wiedenhöft, Max
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

Jumbled Scattered Factors
por: Fleischmann, Pamela, et al.
Publicado: (2025)

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

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

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

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

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

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

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

The Shortest Interesting Binary Words
por: Fici, Gabriele
Publicado: (2024)

The Narayana Morphism and Related Words
por: Shallit, Jeffrey
Publicado: (2025)

Consecutive Power Occurrences in Sturmian Words
por: Bell, Jason, et al.
Publicado: (2024)

Mapped Exponent and Asymptotic Critical Exponent of Words
por: Foster, Eva, et al.
Publicado: (2025)

Group Actions and Some Combinatorics on Words with $\mathbf{vtm}$
por: Machacek, John
Publicado: (2025)

A Connection Between Unbordered Partial Words and Sparse Rulers
por: Saarela, Aleksi, et al.
Publicado: (2024)

On the Complexity of Language Membership for Probabilistic Words
por: Amarilli, Antoine, et al.
Publicado: (2025)

Classifying Words with 3-sort Automata
por: Jastrząb, Tomasz, et al.
Publicado: (2024)

Reversible Transducers over Infinite Words
por: Dartois, Luc, et al.
Publicado: (2024)

The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable
por: Nowotka, Dirk, et al.
Publicado: (2024)

The Equivalence Problem of E-Pattern Languages with Length Constraints is Undecidable
por: Nowotka, Dirk, et al.
Publicado: (2024)

Exact Separation of Words via Trace Geometry
por: Chen, Zeyu, et al.
Publicado: (2026)

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

Characterization of Isometric Words based on Swap and Mismatch Distance
por: Anselmo, M., et al.
Publicado: (2024)

Measure Many Quantum Finite Automata on Infinite Words
por: Midya, Abhisek, et al.
Publicado: (2026)

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)

Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform
por: Fici, Gabriele, et al.
Publicado: (2025)

Recursive Prime Factorizations: Dyck Words as Numbers
por: Childress, Ralph L.
Publicado: (2021)

A Sharper Upper Bound for the Separating Words Problem
por: Dumitru, Bogdan C.
Publicado: (2025)

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

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

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

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

Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
por: Nepeivoda, Antonina, et al.
Publicado: (2025)

An Analysis of Decision Problems for Relational Pattern Languages under Various Constraints
por: Jansen, Klaus, et al.
Publicado: (2025)