Publication Details
Tree-Controlled Grammars with Restrictions Placed upon Cuts and Paths
context-free grammars, tree-controlled grammars, restricted derivation trees, paths, cuts, language families
First, this paper discusses tree-controlled grammars with root-to-leaf derivation-tree paths restricted by control languages. It demonstrates that if the control languages are regular, these grammars generate the family of context-free languages. Then, in a similar way, the paper introduces tree-controlled grammars with derivation-tree cuts restricted by control languages. It proves that if the cuts are restricted by regular languages, these grammars generate the family of recursively enumerable languages. In addition, it places a binary-relation-based restriction upon these grammars and demonstrate that this adi- tional restriction does not affect the generative power of these grammars.
@ARTICLE{FITPUB9699, author = "Ji\v{r}\'{i} Koutn\'{y} and Alexander Meduna", title = "Tree-Controlled Grammars with Restrictions Placed upon Cuts and Paths", pages = "165--175", journal = "Kybernetika", volume = 48, number = 1, year = 2012, ISSN = "0023-5954", language = "english", url = "https://www.fit.vut.cz/research/publication/9699" }