We show that it is decidable whether the language generated by a given context-free grammar over a tree alphabet is a tree language. Furthermore, if the answer to this question is “yes”, then we can even effectively construct a regular tree grammar which generates that tree language
In this thesis, three methods are investigated to express context-free tree languages by regular tre...
The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is...
The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is...
We show that it is decidable whether the language generated by a given context-free grammar over a t...
Jungles generalize trees by sharing subtrees and allowing garbage. It is shown that IO context-free ...
In this thesis, three methods are investigated to express context-free tree languages by regular tre...
AbstractIn this paper we show that non-context-free phenomena can be captured using only limited log...
AbstractWe define context-free grammars with Büchi acceptance condition generating languages of coun...
AbstractGiven a regular language L we construct a pure context-free grammar G such that L is pure co...
AbstractA tree can be represented by a language consisting of a suitable coding of its finite branch...
AbstractContext-free tree grammars, originally introduced by Rounds [Math. Systems Theory 4(3) (1970...
AbstractWe consider the problem of learning a context-free grammar from its structural descriptions....
In this thesis, three methods are investigated to express context-free tree languages by regular tre...
AbstractOne approach to solving the equivalence problem for certain families of context free languag...
AbstractA bracketed grammar is a context-free grammar in which indexed brackets are inserted around ...
In this thesis, three methods are investigated to express context-free tree languages by regular tre...
The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is...
The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is...
We show that it is decidable whether the language generated by a given context-free grammar over a t...
Jungles generalize trees by sharing subtrees and allowing garbage. It is shown that IO context-free ...
In this thesis, three methods are investigated to express context-free tree languages by regular tre...
AbstractIn this paper we show that non-context-free phenomena can be captured using only limited log...
AbstractWe define context-free grammars with Büchi acceptance condition generating languages of coun...
AbstractGiven a regular language L we construct a pure context-free grammar G such that L is pure co...
AbstractA tree can be represented by a language consisting of a suitable coding of its finite branch...
AbstractContext-free tree grammars, originally introduced by Rounds [Math. Systems Theory 4(3) (1970...
AbstractWe consider the problem of learning a context-free grammar from its structural descriptions....
In this thesis, three methods are investigated to express context-free tree languages by regular tre...
AbstractOne approach to solving the equivalence problem for certain families of context free languag...
AbstractA bracketed grammar is a context-free grammar in which indexed brackets are inserted around ...
In this thesis, three methods are investigated to express context-free tree languages by regular tre...
The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is...
The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is...
DOI
Add to ORKG