Cover Image

A cartesian closed fibration of higher-order regular languages

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Melliès, Paul-André, Moreau, Vincent
Format:	Preprint
Published:	2026
Subjects:	Logic in Computer Science Formal Languages and Automata Theory Category Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The categorical contours of the Chomsky-Schützenberger representation theorem
by: Melliès, Paul-André, et al.
Published: (2023)

Profinite trees, through Lawvere theories and the lambda-calculus
by: Moreau, Vincent
Published: (2024)

A formal characterization of discrete condensed objects
by: Asgeirsson, Dagur
Published: (2024)

Fibrational Perspectives on Determinization of Finite-State Automata
by: Li, Thea
Published: (2024)

Categorical Foundations of Formalized Condensed Mathematics
by: Asgeirsson, Dagur, et al.
Published: (2024)

Syntactically and semantically regular languages of lambda-terms coincide through logical relations
by: Moreau, Vincent, et al.
Published: (2023)

An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)

Positive and monotone fragments of FO and LTL
by: Kuperberg, Denis, et al.
Published: (2024)

LeanCat: A Benchmark Suite for Formal Category Theory in Lean (Part I: 1-Categories)
by: Xu, Rongge, et al.
Published: (2025)

Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)

The Complexity of Second-order HyperLTL
by: Frenkel, Hadar, et al.
Published: (2023)

Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
by: Mandrioli, Dino, et al.
Published: (2020)

Word equations, constraints, and formal languages
by: Ciobanu, Laura
Published: (2024)

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

Decision Questions for Probabilistic Automata on Small Alphabets
by: Bell, Paul C., et al.
Published: (2021)

High-Level Message Sequence Charts: Satisfiability and Realizability Revisited
by: Bollig, Benedikt, et al.
Published: (2025)

Slice closures of indexed languages and word equations with counting constraints
by: Ciobanu, Laura, et al.
Published: (2024)

Rethinking meaning and ontologies from the perspective of ontological units
by: Fabry, Paul, et al.
Published: (2025)

Combinatorial manifolds and Kleene's theorem, homotopically
by: Chamoun, Yorgo
Published: (2026)

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

Automata and coalgebras in categories of species
by: Loregian, Fosco
Published: (2024)

Monads and limits in bicategories of circuits
by: Loregian, Fosco
Published: (2025)

Context-Free Languages of String Diagrams
by: Earnshaw, Matt, et al.
Published: (2024)

The structure of polynomial growth for tree automata/transducers and MSO set queries
by: Gallot, Paul, et al.
Published: (2025)

A formal query language and automata model for aggregation in complex event recognition
by: Bourhis, Pierre, et al.
Published: (2026)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
by: Rooduijn, Jan, et al.
Published: (2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)

Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
by: Aceto, Luca, et al.
Published: (2025)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)

An efficient quantifier elimination procedure for Presburger arithmetic
by: Haase, Christoph, et al.
Published: (2024)

Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)

A Hierarchy of Nondeterminism
by: Radi, Bader Abu, et al.
Published: (2022)

A Dichotomy Theorem for Automatic Structures
by: Cuvelier, Antoine, et al.
Published: (2026)

A Completeness Theorem for Probabilistic Regular Expressions
by: Różowski, Wojciech, et al.
Published: (2023)

A Uniform Framework for Language Inclusion Problems
by: Doveri, Kyveli, et al.
Published: (2024)

Recomposition: A New Technique for Efficient Compositional Verification
by: Dardik, Ian, et al.
Published: (2024)

SENTIL: A Runtime Verification Tool for Probabilistic Temporal Logic
by: Quansah, Paapa Kwesi, et al.
Published: (2026)

A Complete Propositional Dynamic Logic for Regular Expressions with Lookahead
by: Nakamura, Yoshiki
Published: (2026)

A Session Type System for Asynchronous Unreliable Broadcast Communication
by: Kouzapas, Dimitrios, et al.
Published: (2019)