Inproceedings,

k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages.

, and .
LACL, volume 3492 of Lecture Notes in Computer Science, page 1-17. Springer, (2005)

Meta data

Tags

Users

  • @dblp

Comments and Reviews