Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
2008 | AFL | regular language,context free grammar |
Field | DocType | Citations |
Tree-adjoining grammar,Context-sensitive grammar,L-attributed grammar,Programming language,Context-free grammar,Regular tree grammar,Indexed grammar,Indexed language,Phrase structure grammar,Mathematics | Conference | 7 |
PageRank | References | Authors |
3.81 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jürgen Dassow | 1 | 530 | 118.27 |
| Bianca Truthe | 2 | 159 | 28.57 |
| ottovonguerickeuniversitat magdeburg | 3 | 10 | 5.34 |