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

Description

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.

Links & Downloads

1. urn:nbn:de:bsz:14-qucosa2-384106
2. 1698848420
3. https://tud.qucosa.de/id/qucosa%3A38410
4. https://tud.qucosa.de/api/qucosa%3A38410/attachment/ATT-0/

Tags

info:eu-repo/classification/ddc/004

ddc:004

Additional Fields

Identifer	oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:38410
Date	20 February 2020
Creators	Denkinger, Tobias
Contributors	Vogler, Heiko, Nederhof, Mark-Jan, Kallmeyer, Laura, Technische Universität Dresden
Source Sets	Hochschulschriftenserver (HSSS) der SLUB Dresden
Language	English
Detected Language	English
Type	info:eu-repo/semantics/publishedVersion, doc-type:doctoralThesis, info:eu-repo/semantics/doctoralThesis, doc-type:Text
Rights	info:eu-repo/semantics/openAccess