Closure properties of linear context-free tree languages with an application to optimality theory |
| |
Authors: | Stephan Kepser Uwe Mönnich |
| |
Affiliation: | University of Tübingen, SFB 441, Nauklerstr. 35, 72074 Tübingen, Germany |
| |
Abstract: | Context-free tree grammars, originally introduced by Rounds Math. Systems Theory 4(3) (1970) 257–287], are powerful grammar devices for the definition of tree languages. The properties of the class of context-free tree languages have been studied for more than three decades now. Particularly important here is the work by Engelfriet and Schmidt J. Comput. System Sci. 15(3) (1977) 328–353, 16(1) (1978) 67–99]. In the present paper, we consider a subclass of the class of context-free tree languages, namely the class of linear context-free tree languages. A context-free tree grammar is linear, if no rule permits the copying of subtrees. For this class of linear context-free tree languages we show that the grammar derivation mode, which is very important for the general class of context-free tree languages, is immaterial. The main result we present is the closure of the class of linear context-free tree languages under linear frontier-to-root tree transduction mappings. Two further results are the closure of this class under linear root-to-frontier tree transduction mappings and under intersection with regular tree languages. |
| |
Keywords: | Context-free tree grammar Optimality theory Finite-state techniques |
本文献已被 ScienceDirect 等数据库收录! |
|