:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Bacik, Piotr
Formato:	Preprint
Publicado:	2024
Materias:	Formal Languages and Automata Theory Number Theory
Acceso en línea:	https://arxiv.org/abs/2409.01221
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

On asymptotically automatic sequences
por: Konieczny, Jakub
Publicado: (2023)

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

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

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

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

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

Brik's sequence: a strange recursion
por: Shallit, Jeffrey
Publicado: (2026)

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

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

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

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

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

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

The Tribonacci constant and finite automata
por: Shallit, Jeffrey
Publicado: (2025)

Extended time Petri nets
por: Radom, Marcin, et al.
Publicado: (2024)

Completely Reachable Almost Group Automata
por: Torres, David Fernando Casas
Publicado: (2024)

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

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

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

Soundness of reset workflow nets
por: Blondin, Michael, et al.
Publicado: (2025)

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

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

The Expansion Problem for Infinite Trees
por: Blumensath, Achim
Publicado: (2023)

Approximate Problems for Finite Transducers
por: Filiot, Emmanuel, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

The Hurt-Sada Array and Zeckendorf Representations
por: Shallit, Jeffrey
Publicado: (2025)

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

Cloitre's Self-Generating Sequence
por: Shallit, Jeffrey
Publicado: (2025)

The Narayana Morphism and Related Words
por: Shallit, Jeffrey
Publicado: (2025)

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

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

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