The emptiness of intersection problem for languages of \(k\)-valued categorial grammars (classical and Lambek) is undecidable (Q4923557)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidable |
scientific article; zbMATH DE number 6165924
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The emptiness of intersection problem for languages of \(k\)-valued categorial grammars (classical and Lambek) is undecidable |
scientific article; zbMATH DE number 6165924 |
Statements
The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidable (English)
0 references
24 May 2013
0 references
0.7468677759170532
0 references
0.7462694644927979
0 references
0.7409867644309998
0 references
