Lambek Grammars with One Division Are Decidable in Polynomial Time (Q3503645): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-79709-8_28 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1488801660 / rank | |||
Normal rank | |||
Revision as of 21:52, 19 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
