|
Hans-Peter Kolb, Uwe Mönnich and Frank MorawietzDescriptions of Cross-Serial Dependencies30pp., PS (531kb). AbstractThe main result of this paper is a description of cross-serial dependencies equivalently in terms of (a) regular tree languages (to express the recursive properties) and regular string languages (to establish the intended linguistic relations) and (b) transductions definable in monadic second-order (MSO) logic which are defined on a domain of finite trees that is characterized as the model set of a closed MSO formula. In fact, we shall not deal directly with the two types of regular language families and MSO definable structures, but shall instead consider implementation in the form of finite-state (tree) automata to emphasize the effectivity of our approach.
|
In case of problems or for comments, please contact: frank@sfs.uni-tuebingen.de Last updated: 13-Mar-2000 |