This paper is a continuation of the study of topological properties of omega context free languages (-CFL). We proved in [Topological Properties of Omega Context Free Languages, T...
We study Nonassociative Lambek Calculus with additives ∧, ∨, satisfying the distributive law (Distributive Full Nonassociative Lambek Calculus DFNL). We prove that categorial g...
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...