A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Categorial grammars with iterated types form a strict hierarchy of k-valued languages
2012
Theoretical Computer Science
The notion of k-valued categorial grammars in which every word is associated to at most k types is often used in the field of lexicalized grammars as a fruitful constraint for obtaining interesting properties like the existence of learning algorithms. This constraint is reasonable only when the classes of k-valued grammars correspond to a real hierarchy of generated languages. Such a hierarchy has been established earlier for the classical categorial grammars. In this paper the hierarchy by the
doi:10.1016/j.tcs.2012.04.024
fatcat:h6enqz7pefekxigaeo2mv65rru