:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Bacik, Piotr
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory Number Theory
Online Access:	https://arxiv.org/abs/2409.01221
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

S-unit equations in modules and linear-exponential Diophantine equations
by: Dong, Ruiwen, et al.
Published: (2025)

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

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

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

Escape of mass of the Thue-Morse sequence
by: Nesharim, Erez, et al.
Published: (2025)

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

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

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

Submonoid Membership in n-dimensional lamplighter groups and S-unit equations
by: Dong, Ruiwen
Published: (2024)

Algebraic power series and their automatic complexity modulo prime powers
by: Rowland, Eric, et al.
Published: (2024)

Using finite automata to compute the base-$b$ representation of the golden ratio and other quadratic irrationals
by: Barnoff, Aaron, et al.
Published: (2024)

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

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

State Complexity of Shifts of the Fibonacci Word
by: Moradi, Delaram, et al.
Published: (2026)

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

Extended time Petri nets
by: Radom, Marcin, et al.
Published: (2024)

Completely Reachable Almost Group Automata
by: Torres, David Fernando Casas
Published: (2024)

Completeness Theorems for Kleene algebra with tests and top
by: Pous, Damien, et al.
Published: (2023)

A Regular and Complete Notion of Delay for Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2022)

Deterministic pushdown automata can compress some normal sequences
by: Carton, Olivier, et al.
Published: (2022)

Soundness of reset workflow nets
by: Blondin, Michael, et al.
Published: (2025)

Completeness for categories of generalized automata
by: Boccali, Guido, et al.
Published: (2023)

[Draft] High-order estimation-based properties and high-order observers for labeled finite-state automata
by: Zhang, Kuize, et al.
Published: (2024)

The Expansion Problem for Infinite Trees
by: Blumensath, Achim
Published: (2023)

Approximate Problems for Finite Transducers
by: Filiot, Emmanuel, et al.
Published: (2025)

Saturation Problems for Families of Automata
by: Bohn, León, et al.
Published: (2025)

On the Separability Problem of VASS Reachability Languages
by: Keskin, Eren, et al.
Published: (2024)

The Similarity Control Problem with Required Events
by: Wang, Yu, et al.
Published: (2026)

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

Transcendence of Hecke-Mahler Series
by: Luca, Florian, et al.
Published: (2024)

A complete formalization of Fermat's Last Theorem for regular primes in Lean
by: Best, Alex, et al.
Published: (2024)

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

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

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

Formalizing zeta and L-functions in Lean
by: Loeffler, David, et al.
Published: (2025)

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

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

Completely reachable automata: a quadratic decision algorithm and a quadratic upper bound on the reaching threshold
by: Ferens, Robert, et al.
Published: (2022)

Quantum finite automata and linear context-free languages: a decidable problem
by: Bertoni, A., et al.
Published: (2013)

Resynchronized Uniformization and Definability Problems for Rational Relations
by: Löding, Christof, et al.
Published: (2021)