Cover Image

Context-Free Languages of String Diagrams

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Earnshaw, Matt, Román, Mario
Format:	Preprint
Published:	2024
Subjects:	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

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

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)

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

Time complexity for deterministic string machines
by: Cataltepe, Ali, et al.
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)

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)

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

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

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

Weighted Context-Free-Language Ordered Binary Decision Diagrams
by: Sistla, Meghana, et al.
Published: (2023)

A Tree Sampler for Bounded Context-Free Languages
by: Considine, Breandan
Published: (2024)

Shuffles of Context-Free Languages along Regular Trajectories
by: Barloy, Corentin, et al.
Published: (2026)

Regular Expressions with Backreferences on Multiple Context-Free Languages, and the Closed-Star Condition
by: Nogami, Taisei, et al.
Published: (2024)

Distributional Learning of Context-Free Languages under Fixed Finite-Monoid Typing
by: Kuriyama, Takayuki
Published: (2014)

Finite-valued Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2024)

Composing Copyless Streaming String Transducers
by: Alur, Rajeev, et al.
Published: (2022)

Directed Regular and Context-Free Languages
by: Ganardi, Moses, et al.
Published: (2024)

Minimizing Streaming String Transducers: An algebraic approach
by: Benalioua, Yahia Idriss, et al.
Published: (2026)

Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
by: Kan, Shuanglong, et al.
Published: (2025)

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

CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams
by: Sistla, Meghana, et al.
Published: (2022)

Measure-Theoretic Aspects of Star-Free and Group Languages
by: Sin'ya, Ryoma, et al.
Published: (2025)

Rewriting Structured Cospans
by: Cicala, Daniel
Published: (2020)

Forbidden-Context & Ordered Grammar Systems
by: Fernau, Henning, et al.
Published: (2026)

A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity
by: Mengel, Stefan, et al.
Published: (2024)

Passive Model Learning of Visibly Deterministic Context-free Grammars
by: Muškardin, Edi, et al.
Published: (2025)

Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas
by: Yamakami, Tomoyuki
Published: (2021)

Well-Formed Free-Choice Petri Nets Revisited
by: Jancar, Petr, et al.
Published: (2026)

Decision Procedure for A Theory of String Sequences
by: Hu, Denghang, et al.
Published: (2025)

Deterministic Parikh automata on infinite words
by: Grobler, Mario, et al.
Published: (2024)

Static Analysis Framework for Detecting Use-After-Free Bugs in C++
by: Teodorescu, Vlad-Alexandru, et al.
Published: (2024)

Universally Wheeler Languages
by: Becker, Ruben, et al.
Published: (2025)

Quantitative Language Automata
by: Henzinger, Thomas A., et al.
Published: (2025)

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

Positive Varieties of Lattice Languages
by: Inoue, Yusuke, et al.
Published: (2025)

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

Operational State Complexity of Block Languages
by: Duarte, Guilherme, et al.
Published: (2024)