:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Yuan, Yijun
Format:	Preprint
Published:	2025
Subjects:	Algebraic Geometry Formal Languages and Automata Theory Logic in Computer Science Number Theory 68V20, 14H60, 03B35, 06B23, 91A80
Online Access:	https://arxiv.org/abs/2509.19632
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Formalizing Computational Paths and Fundamental Groups in Lean
by: Ramos, Arthur F., et al.
Published: (2025)

Cone-Induced Observation Congruences for Vector-Valued Quantitative Languages
by: Alpay, Faruk, et al.
Published: (2026)

Implicit automata in λ-calculi III: affine planar string-to-string functions
by: Pradic, Cécilia, et al.
Published: (2024)

Algebraic Closure of Matrix Sets Recognized by 1-VASS
by: Manssour, Rida Ait El, et al.
Published: (2025)

A vector logic for intensional formal semantics
by: Quigley, Daniel
Published: (2026)

Finite-Horizon First-Order Rank Profiles of Regular Languages
by: Bazarova, Madina, et al.
Published: (2026)

Sparse regular subsets of the reals
by: Bell, Jason, et al.
Published: (2023)

A Dichotomy for $k$-automatic expansions of Presburger Arithmetic
by: Bell, Jason, et al.
Published: (2025)

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

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

On properness of moduli stacks of $D^{\times}$-shtukas over ramified legs
by: Choi, Yong-Gyu, et al.
Published: (2025)

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

Multipass automata and group word problems
by: Ceccherini-Silberstein, Tullio, et al.
Published: (2014)

On Probabilistic $ω$-Pushdown Systems, and $ω$-Probabilistic Computational Tree Logic
by: Lin, Deren, et al.
Published: (2022)

Multiband linear cellular automata and endomorphisms of algebraic vector groups
by: Byszewski, Jakub, et al.
Published: (2022)

Determination of the fifth Busy Beaver value
by: The bbchallenge Collaboration, et al.
Published: (2025)

Lambek pregroups are Frobenius spiders in preorders
by: Pavlovic, Dusko
Published: (2021)

Topoi of automata I: Four topoi of automata and regular languages
by: Hora, Ryuya
Published: (2024)

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

A Logic For Fresh Labelled Transition Systems
by: Bandukara, Mohamed H, 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)

Flavors of Quantifiers in Hyperlogics
by: Chalupa, Marek, et al.
Published: (2025)

Probabilistic automatic complexity of finite strings
by: Gill, Kenneth
Published: (2024)

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

Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version)
by: Nakano, Keisuke, et al.
Published: (2024)

Biprofile Deviation Logic: Report-Replacement Frames and Audit Witnesses
by: Alpay, Faruk, et al.
Published: (2026)

An Alternative Approach to Formal Mathematics that Focuses on Communication and Accessibility
by: Farmer, William M.
Published: (2026)

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

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

A differential approach to Ax-Schanuel, I
by: Blázquez-Sanz, David, et al.
Published: (2021)

Probabilistic Disjunctive Normal Forms in Temporal Logic and Automata Theory
by: Kuznetsov, Alexander
Published: (2026)

A motivic Fundamental Lemma
by: Forey, Arthur, et al.
Published: (2023)

Chatelet's Theorem in Synthetic Algebraic Geometry
by: Coquand, Thierry, et al.
Published: (2025)

An elementary proof of Bridy's theorem
by: Rowland, Eric, et al.
Published: (2023)

Generalised Möbius Categories and Convolution Kleene Algebras
by: Cranch, James, et al.
Published: (2025)

Cellular Automaton Reducibility as a Measure of Complexity for Infinite Words
by: Zubia, Markel, et al.
Published: (2026)

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

Beatty Sequences for a Quadratic Irrational: Decidability and Applications
by: Schaeffer, Luke, et al.
Published: (2024)

Languages of Words of Low Automatic Complexity Are Hard to Compute
by: Chen, Joey, et al.
Published: (2025)