Cover Image

Primitive Two-Dimensional Words and Iterated Pedal Triangles via Symbolic Coding

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Smith, Taylor J.
Format:	Preprint
Published:	2026
Subjects:	Dynamical Systems Formal Languages and Automata Theory Metric Geometry 37B10 (primary), 51M15, 68Q45 (secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Improved Randomized Approximation of Hard Universality and Emptiness Problems
by: Andreou, Pantelis, et al.
Published: (2024)

Multidimensional tilings and MSO logic
by: Pallen, Rémi, et al.
Published: (2025)

Subshifts defined by nondeterministic and alternating plane-walking automata
by: de Menibus, Benjamin Hellouin, et al.
Published: (2024)

Tilings of an Isosceles Triangle
by: Beeson, Michael
Published: (2012)

Density of rational languages under shift invariant measures
by: Berthé, Valérie, et al.
Published: (2025)

Characterization of Erdös matrices by their zero entries
by: Karmakar, Priyanka, et al.
Published: (2025)

On the minimal memory set of cellular automata
by: Castillo-Ramirez, Alonso, et al.
Published: (2024)

One-dimensional cellular automata with a unique active transition
by: Castillo-Ramirez, Alonso, et al.
Published: (2024)

Elementary fractal geometry. 4. Automata-generated topological spaces
by: Bandt, Christoph
Published: (2023)

No weakly factor-universal cellular automaton
by: Gwozdz, Maja
Published: (2026)

The reflection complexity of sequences over finite alphabets
by: Allouche, Jean-Paul, et al.
Published: (2024)

Tiling an Equilateral Triangle
by: Beeson, Michael
Published: (2018)

Structure and computability of preimages in the Game of Life
by: Salo, Ville, et al.
Published: (2023)

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)

A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group
by: Zhu, Yinfeng
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)

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)

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

Convergence of magnitude of finite positive definite metric spaces
by: So, Byungchang
Published: (2025)

Dimensions of orbital sets in complex dynamics
by: Fraser, Jonathan M, et al.
Published: (2025)

Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words
by: Eickmeyer, Kord, et al.
Published: (2025)

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

Languages given by Finite Automata over the Unary Alphabet
by: Czerwiński, Wojciech, et al.
Published: (2023)

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 cornering strategy for synchronizing a DFA
by: Bradshaw, Peter, et al.
Published: (2024)

Further results on generalized cellular automata
by: Castillo-Ramirez, Alonso, et al.
Published: (2023)

Permutation closure for multiple context-free languages
by: Duncan, Andrew, et al.
Published: (2025)

On Countable SFT Covers of Sparse Multidimensional Shift Spaces
by: Törmä, Ilkka
Published: (2024)

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