Imagen de Portada

On a sequence of Kimberling and its relationship to the Tribonacci word

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Dvořáková, Lubomíra, Pelantová, Edita, Shallit, Jeffrey
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

The Tribonacci constant and finite automata
por: Shallit, Jeffrey
Publicado: (2025)

Brik's sequence: a strange recursion
por: Shallit, Jeffrey
Publicado: (2026)

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

Balanced Fibonacci word rectangles, and beyond
por: Shallit, Jeffrey, et al.
Publicado: (2025)

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

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

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)

The Hurt-Sada Array and Zeckendorf Representations
por: Shallit, Jeffrey
Publicado: (2025)

Cloitre's Self-Generating Sequence
por: Shallit, Jeffrey
Publicado: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

Beatty Sequences for a Quadratic Irrational: Decidability and Applications
por: Schaeffer, Luke, et al.
Publicado: (2024)

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

New properties of the $φ$-representation of integers
por: Shallit, Jeffrey, et al.
Publicado: (2025)

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

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

An 'Experimental Mathematics' Approach to Stolarsky Interspersions via Automata Theory
por: Shallit, Jeffrey
Publicado: (2025)

Proving Properties of $φ$-Representations with the Walnut Theorem-Prover
por: Shallit, Jeffrey
Publicado: (2023)

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

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

Mapping words to powers by morphisms
por: Saarela, Aleksi
Publicado: (2025)

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

Word-Representable Graphs and Locality of Words
por: Böll, Philipp, 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)

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)