Random context tree grammars and tree transducers
نویسندگان
چکیده
Regular tree grammars and top-down tree transducers are extended by random context sensitivity as known from the areas of string and picture generation. First results regarding the generative power of the resulting devices are presented. In particular, we investigate the path languages of random context tree languages. Copyright c © 2005 UMINF 05.02 ISSN 0348-0542
منابع مشابه
The Generating Power of Total Deterministic Tree Transducers
Attributed tree transducers are abstract models used to study properties of attribute grammars. One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that arbitrary trees over a ranked alphabet are taken as input, instead of derivation trees of a context-free grammar. In this paper we show that with respect to the generating power this is not an abstrac...
متن کاملOn the Generating Power of Deterministic Tree Transducers
Attributed tree transducers are abstract models to study properties of attribute grammars. One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that arbitrary trees over a ranked alphabet are taken as input, instead of derivation trees of a context{free grammar. In this paper we show that with respect to the generating power this is not an abstraction,...
متن کاملSynchronous Context-Free Tree Grammars
We consider pairs of context-free tree grammars combined through synchronous rewriting. The resulting formalism is at least as powerful as synchronous tree adjoining grammars and linear, nondeleting macro tree transducers, while the parsing complexity remains polynomial. Its power is subsumed by context-free hypergraph grammars. The new formalism has an alternative characterization in terms of ...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملA Short Introduction to Formal Linguistics
1 Mildly Context-Sensitive Syntax 5 1.1 Tree Adjoining Grammars . . . . . . . . . . . . . . . . . . . . . . . 6 1.1.1 Linguistic Analyses Using TAGs . . . . . . . . . . . . . . . . 8 Lexicalized Grammar . . . . . . . . . . . . . . . . . . . . . . 8 Long-Distance Dependencies . . . . . . . . . . . . . . . . . 9 1.1.2 Background: Context-Free Tree Grammars . . . . . . . . . . 10 IO and OI Derivat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- South African Computer Journal
دوره 34 شماره
صفحات -
تاریخ انتشار 2005