Cover Image

Runs, Squares, Palindromes, and Unbordered Factors of a Family of Binary Pattern Sequences with the All-One Pattern

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Hendel, Russell Jay
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory 68Q45 11B85
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Mahler equations for Zeckendorf numeration
by: Carton, Olivier, et al.
Published: (2024)

Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences
by: Couvreur, Jean-Michel, et al.
Published: (2025)

Opacity complexity of automatic sequences. The general case
by: Allouche, J. -P., et al.
Published: (2024)

Cobham's theorem for the Gaussian integers
by: Bustos-Gajardo, Álvaro, et al.
Published: (2025)

Presheaf automata
by: Struth, Georg, et al.
Published: (2024)

A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group
by: Zhu, Yinfeng
Published: (2024)

The Algebra of Nondeterministic Finite Automata
by: Gorrieri, Roberto
Published: (2023)

Deterministic Suffix-reading Automata
by: Keerthan, R, et al.
Published: (2025)

List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata
by: Volkov, Mikhail V.
Published: (2025)

A hierarchy of reversible finite automata
by: Radionova, Maria, et al.
Published: (2024)

On Computational Completeness of Semi-Conditional Matrix Grammars
by: Fernau, Henning, et al.
Published: (2024)

Nondeterministic tree-walking automata are not closed under complementation
by: Martynova, Olga, et al.
Published: (2024)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata
by: Petrov, Semyon, et al.
Published: (2024)

Mostowski Index via extended register games
by: Idir, Olivier, et al.
Published: (2024)

An $L^{\#}$ Based Algorithm for Active Learning of Minimal Separating Automata
by: Laumen, Jasper, et al.
Published: (2026)

From regular expressions to deterministic finite automata: $2^{\frac{n}{2}+\sqrt{n}(\log n)^{Θ(1)}}$ states are necessary and sufficient
by: Martynova, Olga, et al.
Published: (2025)

Bounded Languages Described by GF(2)-grammars
by: Makarov, Vladislav
Published: (2019)

Linear equations and recursively enumerable sets
by: Honkala, Juha
Published: (2024)

Around Don's conjecture for binary completely reachable automata
by: Zhu, Yinfeng
Published: (2024)

Don's conjecture for binary completely reachable automata: an approach and its limitations
by: Casas, David, et al.
Published: (2023)

Monochromatic arithmetic progressions in the Fibonacci, Thue-Morse, and Rudin-Shapiro words
by: Joshi, Gandhar, et al.
Published: (2025)

Bandwidth of Nondeterministic Finite Automata
by: Cho, Da-Jung, et al.
Published: (2026)

Semidirect Product Decompositions for Periodic Regular Languages
by: Inoue, Yusuke, et al.
Published: (2024)

A Fibonacci analogue of the two's complement numeration system
by: Labbé, Sébastien, et al.
Published: (2022)

A generalization of Deterministic Finite Automata related to discharging
by: Campbell, John M.
Published: (2025)

On the growth of hypergeometric sequences
by: Kenison, George, et al.
Published: (2025)

Addition Automata and Attractors of Digit Systems Corresponding to Expanding Rational Matrices
by: Cruz, Anjelo Gabriel R., et al.
Published: (2025)

On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages
by: Yordzhev, Krasimir
Published: (2026)

A polynomial-time algorithm for the automatic Baire property
by: Staiger, Ludwig
Published: (2025)

On Languages Describing Large Graph Classes
by: Fernau, Henning, et al.
Published: (2026)

A note on Automatic Baire property
by: Staiger, Ludwig
Published: (2025)

Dissecting power of intersection of two context-free languages
by: Rukavicka, Josef
Published: (2020)

Weakly-unambiguous Parikh automata and their link to holonomic series
by: Bostan, Alin, et al.
Published: (2025)

Reduced complexities for sequences over finite alphabets
by: Campbell, John M., et al.
Published: (2025)

A Note on the Relation between Recognisable Series and Regular Sequences, and their Minimal Linear Representations
by: Heuberger, Clemens, et al.
Published: (2022)

On Transition Constructions for Automata -- A Categorical Perspective
by: Cruchten, Mike
Published: (2024)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
by: Guillon, Bruno, et al.
Published: (2025)

Kleene Theorems for Lasso Languages and $ω$-Languages
by: Cruchten, Mike
Published: (2024)

Input-Erasing Two-Way Finite Automata
by: Meduna, Alexander, et al.
Published: (2025)

Illustrating Finite Automata with Grail+ and TikZ
by: May, Alastair, et al.
Published: (2024)