Cover Image

The categorical contours of the Chomsky-Schützenberger representation theorem

Fuente: arXiv

Saved in:

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

Similar Items

A cartesian closed fibration of higher-order regular languages
by: Melliès, Paul-André, et al.
Published: (2026)

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)

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

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

Relating Reversible Petri Nets and Reversible Event Structures, categorically
by: Melgratti, Hernán, et al.
Published: (2023)

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

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

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

A categorical framework for cellular automata
by: Castillo-Ramirez, A., et al.
Published: (2026)

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

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

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)

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

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)

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

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

An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, 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)

Time complexity for deterministic string machines
by: Cataltepe, Ali, et al.
Published: (2024)

Parikh's Theorem Made Symbolic
by: Hague, Matthew, et al.
Published: (2023)

Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise
by: Ye, Lina, et al.
Published: (2023)

On-the-fly Unfolding with Optimal Exploration for Linear Temporal Logic Model Checking of Concurrent Software and Systems
by: Li, Shuo, et al.
Published: (2023)

Parikh Automata on Finite and Infinite Words
by: Grobler, Mario, et al.
Published: (2023)

Feasability of Learning Weighted Automata on a Semiring
by: Daviaud, Laure, et al.
Published: (2023)

Discounted-Sum Automata with Multiple Discount Factors
by: Boker, Udi, et al.
Published: (2023)

The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations
by: Bozga, Marius, et al.
Published: (2023)

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

Parity Games on Temporal Graphs
by: Austin, Pete, et al.
Published: (2023)

The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
by: Daviaud, Laure, et al.
Published: (2023)

Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata
by: Jecker, Ismaël, et al.
Published: (2023)

Characterizations of Monadic Second Order Definable Context-Free Sets of Graphs
by: Iosif, Radu, et al.
Published: (2023)

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