A note on context-free languages

DOI10.1016/0022-4049(89)90151-5zbMath0685.18001OpenAlexW2065739476MaRDI QIDQ1825945

Robert F. C. Walters

Publication date: 1989

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-4049(89)90151-5

zbMATH Keywords

context-free languagesregular languagesfree category on a reflexive graph

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Graphs, diagram schemes, precategories (18A10) Groupoids, semigroupoids, semigroups, groups (viewed as categories) (18B40)

Related Items (6)

Quantaloids, enriched categories and automata theory ⋮ A categorical look at tree automata and context-free languages ⋮ Connected limits, familial representability and Artin glueing ⋮ The free category with products on a multigraph ⋮ Unnamed Item ⋮ Code migration and program maintainability -- A categorical perspective

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on context-free languages