Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dvořáková, Lubomíra, Pelantová, Edita, Shallit, Jeffrey
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Tribonacci constant and finite automata
by: Shallit, Jeffrey
Published: (2025)

Brik's sequence: a strange recursion
by: Shallit, Jeffrey
Published: (2026)

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

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

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

Ten Squares Force an Overlap
by: Shallit, Jeffrey
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)

The Hurt-Sada Array and Zeckendorf Representations
by: Shallit, Jeffrey
Published: (2025)

Cloitre's Self-Generating Sequence
by: Shallit, Jeffrey
Published: (2025)

The Narayana Morphism and Related Words
by: Shallit, Jeffrey
Published: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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)

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

Half-flips are 5-avoidable
by: Ochem, Pascal
Published: (2026)