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 | DOI | Venue |
|---|---|---|
2010 | 10.1142/S0129054110007520 | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE |
Keywords | Field | DocType |
Tree controlled grammars, subregular control languages, generative capacity | Context-sensitive grammar,Tree-adjoining grammar,Programming language,Context-free grammar,L-attributed grammar,Regular tree grammar,Indexed grammar,Indexed language,Phrase structure grammar,Mathematics | Journal |
Volume | Issue | ISSN |
21 | 5 | 0129-0541 |
Citations | PageRank | References |
7 | 0.56 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jürgen Dassow | 1 | 530 | 118.27 |
| Ralf Stiebe | 2 | 85 | 12.78 |
| Bianca Truthe | 3 | 159 | 28.57 |