A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Nonterminal complexity of tree controlled grammars
2011
Theoretical Computer Science
Preserved Fulltext
This paper studies the nonterminal complexity of tree controlled grammars. It is proved that the number of nonterminals in tree controlled grammars without erasing rules leads to an infinite hierarchy of families of tree controlled languages, while every recursively enumerable language can be generated by a tree controlled grammar with erasing rules and at most nine nonterminals.
doi:10.1016/j.tcs.2011.06.033
fatcat:7zhugq7fmngmzdz6ufkhmza4vq