Gaifman's theorem on categorial grammars revisited
From MaRDI portal
Using Lambek's calculus of syntactic types a new proof of Gaifman's theorem on the equivalence of standard categorial grammars and context- free grammars is obtained.
Cites work
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Essays in logical semantics
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- scientific article; zbMATH DE number 4002071 (Why is no real title available?)
- scientific article; zbMATH DE number 4002073 (Why is no real title available?)
- scientific article; zbMATH DE number 4002074 (Why is no real title available?)
- scientific article; zbMATH DE number 4045723 (Why is no real title available?)
- scientific article; zbMATH DE number 3254899 (Why is no real title available?)
- Optimization of LR(k) parsers
- The Equivalence of Unidirectional Lambek Categorial Grammars and Context‐Free Grammars
- The Mathematics of Sentence Structure
Cited in
(5)
This page was built for publication: Gaifman's theorem on categorial grammars revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115429)