The OI tree languages are generalized to an OI n-dimensional forest language hierarchy in a manner analogous to the generali- zation of the IO tree languages to the IO n-dimensional forest hierarchy of Baldwin 1 . This involves the generalization of the substitution of trees into trees and sets of trees into sets of trees to include IO and OI n-dimensional forests. The frontier function is extended to include the expansion of nonterminals. The Engelfriet-Schmidt language hierarchy is shown to be contained in the OI n-dimensional hierarchy. The IO n-dimensional forest languages are shown to be the n-dimensional frontiers of the (n + 1)-dimensional OI forest languages. It is established that the OI macro languages are equivalent to the string...
AbstractIn this paper grammatical codes of trees are investigated. In particular, it is shown how to...
AbstractThe notion of P-interpreted top-down tree generators is introduced, combining the nondetermi...
Tree transducers (automata which read finite labeled trees and output finite labeled trees) are used...
AbstractA new data structure is presented which may be used to specify programming languages. It is ...
This paper studies the nonterminal complexity of tree controlled grammars. It is proved that the num...
The paper presents an example of a representation of parse tree forests advocated by the author. Alt...
AbstractThis paper studies the nonterminal complexity of tree controlled grammars. It is proved that...
AbstractThis paper sets into relation three different classes of trees: (i) mod r-valent planted pla...
In this paper the tree model – a well-formed tree is shortly described. After that the language fami...
AbstractA tree controlled grammar is specified as a pair (G,G′) where G is a context-free grammar an...
AbstractControlling the OI-derivations of high-level grammars by high-level languages does not influ...
International audienceWe study tree languages that can be defined in Δ2. These are tree languages de...
A tree controlled grammar is specified as a pair (G, G′) where G is a context-free grammar and G′ is...
the date of receipt and acceptance should be inserted later Abstract The equivalence of leaf languag...
Do all humans perceive, think, and talk about tree cover (“forests”) in more or less the same way? I...
AbstractIn this paper grammatical codes of trees are investigated. In particular, it is shown how to...
AbstractThe notion of P-interpreted top-down tree generators is introduced, combining the nondetermi...
Tree transducers (automata which read finite labeled trees and output finite labeled trees) are used...
AbstractA new data structure is presented which may be used to specify programming languages. It is ...
This paper studies the nonterminal complexity of tree controlled grammars. It is proved that the num...
The paper presents an example of a representation of parse tree forests advocated by the author. Alt...
AbstractThis paper studies the nonterminal complexity of tree controlled grammars. It is proved that...
AbstractThis paper sets into relation three different classes of trees: (i) mod r-valent planted pla...
In this paper the tree model – a well-formed tree is shortly described. After that the language fami...
AbstractA tree controlled grammar is specified as a pair (G,G′) where G is a context-free grammar an...
AbstractControlling the OI-derivations of high-level grammars by high-level languages does not influ...
International audienceWe study tree languages that can be defined in Δ2. These are tree languages de...
A tree controlled grammar is specified as a pair (G, G′) where G is a context-free grammar and G′ is...
the date of receipt and acceptance should be inserted later Abstract The equivalence of leaf languag...
Do all humans perceive, think, and talk about tree cover (“forests”) in more or less the same way? I...
AbstractIn this paper grammatical codes of trees are investigated. In particular, it is shown how to...
AbstractThe notion of P-interpreted top-down tree generators is introduced, combining the nondetermi...
Tree transducers (automata which read finite labeled trees and output finite labeled trees) are used...