:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Bacik, Piotr
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory Number Theory
Accès en ligne:	https://arxiv.org/abs/2409.01221
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

S-unit equations in modules and linear-exponential Diophantine equations
par: Dong, Ruiwen, et autres
Publié: (2025)

On asymptotically automatic sequences
par: Konieczny, Jakub
Publié: (2023)

A Sharper Upper Bound for the Separating Words Problem
par: Dumitru, Bogdan C.
Publié: (2025)

Arithmetical subword complexity of automatic sequences
par: Konieczny, Jakub, et autres
Publié: (2023)

Escape of mass of the Thue-Morse sequence
par: Nesharim, Erez, et autres
Publié: (2025)

New properties of the $φ$-representation of integers
par: Shallit, Jeffrey, et autres
Publié: (2025)

Recursive Prime Factorizations: Dyck Words as Numbers
par: Childress, Ralph L.
Publié: (2021)

Brik's sequence: a strange recursion
par: Shallit, Jeffrey
Publié: (2026)

Submonoid Membership in n-dimensional lamplighter groups and S-unit equations
par: Dong, Ruiwen
Publié: (2024)

Algebraic power series and their automatic complexity modulo prime powers
par: Rowland, Eric, et autres
Publié: (2024)

Using finite automata to compute the base-$b$ representation of the golden ratio and other quadratic irrationals
par: Barnoff, Aaron, et autres
Publié: (2024)

Proving Properties of $φ$-Representations with the Walnut Theorem-Prover
par: Shallit, Jeffrey
Publié: (2023)

An 'Experimental Mathematics' Approach to Stolarsky Interspersions via Automata Theory
par: Shallit, Jeffrey
Publié: (2025)

State Complexity of Shifts of the Fibonacci Word
par: Moradi, Delaram, et autres
Publié: (2026)

The Tribonacci constant and finite automata
par: Shallit, Jeffrey
Publié: (2025)

Extended time Petri nets
par: Radom, Marcin, et autres
Publié: (2024)

Completely Reachable Almost Group Automata
par: Torres, David Fernando Casas
Publié: (2024)

Completeness Theorems for Kleene algebra with tests and top
par: Pous, Damien, et autres
Publié: (2023)

A Regular and Complete Notion of Delay for Streaming String Transducers
par: Filiot, Emmanuel, et autres
Publié: (2022)

Deterministic pushdown automata can compress some normal sequences
par: Carton, Olivier, et autres
Publié: (2022)

Soundness of reset workflow nets
par: Blondin, Michael, et autres
Publié: (2025)

Completeness for categories of generalized automata
par: Boccali, Guido, et autres
Publié: (2023)

[Draft] High-order estimation-based properties and high-order observers for labeled finite-state automata
par: Zhang, Kuize, et autres
Publié: (2024)

The Expansion Problem for Infinite Trees
par: Blumensath, Achim
Publié: (2023)

Approximate Problems for Finite Transducers
par: Filiot, Emmanuel, et autres
Publié: (2025)

Saturation Problems for Families of Automata
par: Bohn, León, et autres
Publié: (2025)

On the Separability Problem of VASS Reachability Languages
par: Keskin, Eren, et autres
Publié: (2024)

The Similarity Control Problem with Required Events
par: Wang, Yu, et autres
Publié: (2026)

Consecutive Power Occurrences in Sturmian Words
par: Bell, Jason, et autres
Publié: (2024)

Transcendence of Hecke-Mahler Series
par: Luca, Florian, et autres
Publié: (2024)

A complete formalization of Fermat's Last Theorem for regular primes in Lean
par: Best, Alex, et autres
Publié: (2024)

Complexity of Linear Subsequences of $k$-Automatic Sequences
par: Moradi, Delaram, et autres
Publié: (2025)

Balanced Fibonacci word rectangles, and beyond
par: Shallit, Jeffrey, et autres
Publié: (2025)

The Hurt-Sada Array and Zeckendorf Representations
par: Shallit, Jeffrey
Publié: (2025)

Formalizing zeta and L-functions in Lean
par: Loeffler, David, et autres
Publié: (2025)

Cloitre's Self-Generating Sequence
par: Shallit, Jeffrey
Publié: (2025)

The Narayana Morphism and Related Words
par: Shallit, Jeffrey
Publié: (2025)

Completely reachable automata: a quadratic decision algorithm and a quadratic upper bound on the reaching threshold
par: Ferens, Robert, et autres
Publié: (2022)

Quantum finite automata and linear context-free languages: a decidable problem
par: Bertoni, A., et autres
Publié: (2013)

Resynchronized Uniformization and Definability Problems for Rational Relations
par: Löding, Christof, et autres
Publié: (2021)