Two characterisation results of multiple context-free grammars and their application to parsing

In the first part of this thesis, a Chomsky-Schützenberger characterisation and an automaton characterisation of multiple context-free grammars are proved. Furthermore, a framework for approximation of automata with storage is described. The second part develops each of the three theoretical results into a parsing algorithm

On Hotz groups and homomorphic images of sentential form languages

SIGLETIB: RN 3437 (107) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman