The equivalence of leaf languages of tree adjoining grammars and monadic linear context-free grammars was shown about a decade ago. This paper presents a proof of the strong equivalence of these ...
CONTENT IN CONTEXT: NoRedInk’s online grammar exercises are now no longer limited to single sentences. After all, says Jeff Scheur, CEO of the San Francisco-based startup, standalone sentences, devoid ...
In this paper we prove the Chomsky Conjecture (all languages recognized by the Lambek calculus are context-free) for both the full Lambek calculus and its product-free fragment. For the latter case we ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback