Image de couverture de livre

Monads and limits in bicategories of circuits

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Loregian, Fosco
Format:	Preprint
Publié:	2025
Sujets:	Category Theory Formal Languages and Automata Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Automata and coalgebras in categories of species
par: Loregian, Fosco
Publié: (2024)

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

Combinatorial manifolds and Kleene's theorem, homotopically
par: Chamoun, Yorgo
Publié: (2026)

Context-Free Languages of String Diagrams
par: Earnshaw, Matt, et autres
Publié: (2024)

Time complexity for deterministic string machines
par: Cataltepe, Ali, et autres
Publié: (2024)

The categorical contours of the Chomsky-Schützenberger representation theorem
par: Melliès, Paul-André, et autres
Publié: (2023)

Fibrational Perspectives on Determinization of Finite-State Automata
par: Li, Thea
Publié: (2024)

Categorical Foundations of Formalized Condensed Mathematics
par: Asgeirsson, Dagur, et autres
Publié: (2024)

A formal characterization of discrete condensed objects
par: Asgeirsson, Dagur
Publié: (2024)

Profinite trees, through Lawvere theories and the lambda-calculus
par: Moreau, Vincent
Publié: (2024)

A cartesian closed fibration of higher-order regular languages
par: Melliès, Paul-André, et autres
Publié: (2026)

A categorical framework for cellular automata
par: Castillo-Ramirez, A., et autres
Publié: (2026)

Monads, Comonads, and Transducers
par: Stefański, Rafał
Publié: (2024)

Monadic Context Engineering
par: Zhang, Yifan, et autres
Publié: (2025)

Rewriting Structured Cospans
par: Cicala, Daniel
Publié: (2020)

Nondeterminism makes unary 1-limited automata concise
par: Guillon, Bruno, et autres
Publié: (2025)

LeanCat: A Benchmark Suite for Formal Category Theory in Lean (Part I: 1-Categories)
par: Xu, Rongge, et autres
Publié: (2025)

Characterizations of Monadic Second Order Definable Context-Free Sets of Graphs
par: Iosif, Radu, et autres
Publié: (2023)

Embedding arbitrary Boolean circuits into fungal automata with arbitrary update sequences
par: Goles, Eric, et autres
Publié: (2026)

A General Information Extraction Framework Based on Formal Languages
par: Schmid, Markus L.
Publié: (2025)

Statistical process discovery
par: Cry, Pierre, et autres
Publié: (2025)

Reasoning about Rare-Event Reachability in Stochastic Vector Addition Systems via Affine Vector Spaces
par: Jeppson, Joshua, et autres
Publié: (2025)

Hyper pattern matching
par: Waga, Masaki, et autres
Publié: (2025)

Input-Driven Pushdown Automata with Translucent Input Letters
par: Kutrib, Martin, et autres
Publié: (2025)

Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
par: Kan, Shuanglong, et autres
Publié: (2025)

Componentwise Automata Learning for System Integration (Extended Version)
par: Fujinami, Hiroya, et autres
Publié: (2025)

Universality Frontier for Asynchronous Cellular Automata
par: Baburin, Ivan, et autres
Publié: (2025)

Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata
par: Mazowiecki, Filip, et autres
Publié: (2025)

Frequency Automata: A novel formal model of hybrid systems in combined time and frequency domains
par: Kim, Moon, et autres
Publié: (2025)

Castor Ministerialis
par: Hercher, Christian
Publié: (2025)

Semiflows, Home Spaces, and Home States, Applications to the Analysis of Parameterized Petri Nets
par: Memmi, Gerard
Publié: (2025)

Unambiguisability and Register Minimisation of Min-Plus Models
par: Almagor, Shaull, et autres
Publié: (2025)

Passive Learning of Lattice Automata from Recurrent Neural Networks
par: Slimi, Jaouhar, et autres
Publié: (2025)

An Automata-Based Method to Formalize Psychological Theories -- The Case Study of Lazarus and Folkman's Stress Theory
par: Finkel, Alain, et autres
Publié: (2025)

Structural Abstraction and Refinement for Probabilistic Programs
par: Li, Guanyan, et autres
Publié: (2025)

Universally Wheeler Languages
par: Becker, Ruben, et autres
Publié: (2025)

FocusE: A semantic extension of FocusST
par: Spichkova, Maria
Publié: (2025)

Polyregular Model Checking
par: Lopez, Aliaume, et autres
Publié: (2025)

Reversible Pebble Transducers
par: Dartois, Luc, et autres
Publié: (2025)

On the Complexity of Language Membership for Probabilistic Words
par: Amarilli, Antoine, et autres
Publié: (2025)