A polynomial algorithm for the membership problem with categorial grammars

DOI10.1016/0304-3975(95)00211-1zbMath0871.68118OpenAlexW2010708274MaRDI QIDQ671431

Isabelle Tellier, Alain Finkel

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00211-1

zbMATH Keywords

complexitypolynomial algorithmmembership problemCocke-Kasami-Younger algorithm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

A Graph-Theoretic Approach to Sequent Derivability in the Lambek Calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Categorial grammar - A basis for a natural language calculus?
• The Mathematics of Sentence Structure
• Axiomatizability of Ajdukiewicz‐Lambek Calculus by Means of Cancellation Schemes
• The equivalence of two concepts of categorial grammar

This page was built for publication: A polynomial algorithm for the membership problem with categorial grammars