Path Languages of rpc Tree Grammars are Regular
نویسندگان
چکیده
The path languages of random permitting context tree languages are investigated. The main result is that these path languages are regular. This confirms a previous conjecture. Copyright c © 2005 UMINF 05.23 ISSN 0348-0542
منابع مشابه
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...
متن کامل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
متن کاملExpressing Context-Free Tree Languages by Regular Tree Grammars
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 co...
متن کاملPreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars
Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...
متن کاملSubregularly Tree Controlled Grammars and Languages
Tree controlled grammars are context-free grammars where the associated language only contains those terminal words which have a derivation where the word of any level of the corresponding derivation tree belongs to a given regular language. We present some results on the power of such grammars where we restrict the regular languages to some known subclasses of the family of regular languages.
متن کامل