A note on the strong and weak generative powers of formal systems

DOI10.1016/S0304-3975(01)00347-4zbMath1026.68090MaRDI QIDQ1870566

Aravind K. Joshi

Publication date: 14 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

strong generative capacitylexicalized tree-adjoining grammarscrossing dependenciesLambek grammarsmulti-component grammarstree insertion grammars

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• An operational and denotational approach to non-context-freeness
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• The Mathematics of Sentence Structure
• Product-free Lambek calculus and context-free grammars
• Context-sensitive immediate constituent analysis---context-free languages revisited

This page was built for publication: A note on the strong and weak generative powers of formal systems