Normal forms and automata for categorical dependency grammars

We establish some properties of generalized Categorial Dependency Grammars (gCDG) introduced in the papers [5,6]. A normal form of gCDGs is defined which is similar to Greibach normal form for cf-grammars. It is proved that each gCDG-language can be obtained via homomorphism of the intersection of cf-language and some kind of multibracket language. A class of push-down automata with counters is defined which accept all gCDG-languages.