Lambek Grammars with One Division Are Decidable in Polynomial Time (Q3503645): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 11:33, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lambek Grammars with One Division Are Decidable in Polynomial Time |
scientific article |
Statements
Lambek Grammars with One Division Are Decidable in Polynomial Time (English)
0 references
5 June 2008
0 references
