Lambek Grammars with One Division Are Decidable in Polynomial Time (Q3503645)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5285312
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lambek Grammars with One Division Are Decidable in Polynomial Time |
scientific article; zbMATH DE number 5285312 |
Statements
Lambek Grammars with One Division Are Decidable in Polynomial Time (English)
0 references
5 June 2008
0 references
0.8965445
0 references
0.8924018
0 references
0.87570536
0 references
0.81814736
0 references
0 references
0.8016183
0 references
0.80026376
0 references
0.79378194
0 references
