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

DOI10.1016/S0304-3975(01)00347-4zbMATH Open1026.68090MaRDI QIDQ1870566FDOQ1870566

Authors: Aravind K. Joshi 

Publication date: 14 May 2003

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

Recommendations

• On a power of $n$-ary relational systems carried by strong homomorphisms
• Publication:4953844
• scientific article; zbMATH DE number 4070873
• On Uniformly Constructive and Semiconstructive Formal Systems
• On powers of relational and algebraic systems
• scientific article; zbMATH DE number 5060344
• scientific article; zbMATH DE number 3878384
• Generics for computable Mathias forcing
• Nisan-Wigderson generators in proof systems with forms of interpolation
• Extension of the formal system of the theory of expressions with arities and its strong normalization property

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The Mathematics of Sentence Structure
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Title not available (Why is that?)
• Product-free Lambek calculus and context-free grammars
• Context-sensitive immediate constituent analysis -- context-free languages revisited
• An operational and denotational approach to non-context-freeness

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Grammars for language and genes. Theoretical and empirical investigations. Foreword by Aravind K. Joshi

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870566)