Lambek Grammars with One Division Are Decidable in Polynomial Time (Q3503645)
From MaRDI portal
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
