- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 1 to 4 of 4 (0.042 seconds)Spelling suggestions: "subject:"baumsprachen"" "subject:"fachsprache""
| 1 |
New Results on Context-Free Tree LanguagesOsterholzer, Johannes 04 June 2018 (has links) (PDF)
Context-free tree languages play an important role in algebraic semantics and are applied in mathematical linguistics. In this thesis, we present some new results on context-free tree languages.
|
| 2 |
New Results on Context-Free Tree LanguagesOsterholzer, Johannes 04 May 2018 (has links)
Context-free tree languages play an important role in algebraic semantics and are applied in mathematical linguistics. In this thesis, we present some new results on context-free tree languages.
|
| 3 |
Expressing Context-Free Tree Languages by Regular Tree GrammarsTeichmann, Markus 29 May 2017 (has links) (PDF)
In this thesis, three methods are investigated to express context-free tree languages by regular tree grammars. The first method is a characterization. We show restrictions to context-free tree grammars such that, for each restricted context-free tree grammar, a regular tree grammar can be constructed that induces the same tree language. The other two methods are approximations. An arbitrary context-free tree language can be approximated by a regular tree grammar with a restricted pushdown storage. Furthermore, we approximate weighted context-free tree languages, induced by weighted linear nondeleting context-free tree grammars, by showing how to approximate optimal weights for weighted regular tree grammars.
|
| 4 |
Expressing Context-Free Tree Languages by Regular Tree GrammarsTeichmann, Markus 12 April 2017 (has links)
In this thesis, three methods are investigated to express context-free tree languages by regular tree grammars. The first method is a characterization. We show restrictions to context-free tree grammars such that, for each restricted context-free tree grammar, a regular tree grammar can be constructed that induces the same tree language. The other two methods are approximations. An arbitrary context-free tree language can be approximated by a regular tree grammar with a restricted pushdown storage. Furthermore, we approximate weighted context-free tree languages, induced by weighted linear nondeleting context-free tree grammars, by showing how to approximate optimal weights for weighted regular tree grammars.
|
Page generated in 0.0478 seconds