A polynomial algorithm for the membership problem with categorial grammars
type: Item
instance of: scholarly article
title: A polynomial algorithm for the membership problem with categorial grammars
zbMATH Open document ID: 0871.68118
DOI: 10.1016/0304-3975(95)00211-1
author: Alain Finkel
author: Isabelle Tellier
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 983297
zbMATH Keywords: membership problem
zbMATH Keywords: complexity
zbMATH Keywords: Cocke-Kasami-Younger algorithm
zbMATH Keywords: polynomial algorithm
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00211-1
OpenAlex ID: W2010708274
cites work: Q5536273
cites work: Q5541333
cites work: Q5536271
cites work: The equivalence of two concepts of categorial grammar
cites work: Categorial grammar - A basis for a natural language calculus?
cites work: The Mathematics of Sentence Structure
cites work: Axiomatizability of Ajdukiewicz‐Lambek Calculus by Means of Cancellation Schemes
Recommended article: On the membership problem for non-linear abstract categorial grammars
Recommended article: Q3727407
Recommended article: Membership for growing context-sensitive grammars is polynomial
Recommended article: Q3321473
Recommended article: Non‐associative Lambek Categorial Grammar in Polynomial Time
Recommended article: A Polynomial Algorithm for the Inference of Context Free Languages
Recommended article: Power properties of NLC graph grammars with a polynomial membership problem
Recommended article: Q3787507
Recommended article: Q3787517
Recommended article: On the Membership Problem of Permutation Grammars — A Direct Proof of NP-Completeness
description: scientific article; zbMATH DE number 983297