Author:
Turaev Sherzod,Dassow Jürgen,Manea Florin,Selamat Mohd Hasan
Subject
General Computer Science,Theoretical Computer Science
Reference24 articles.
1. On the complexity of regulated rewriting;Cremers;Information and Control,1974
2. Scattered context grammars generated any recursively enumerable language with two nonterminals;Csuhaj-Varjú;Information Processing Letters,2010
3. Tree controlled grammars;Čulik II;Computing,1977
4. Remarks on the complexity of regulated rewriting;Dassow;Fundamenta Informaticae,1984
5. Further remarks on the complexity of regulated rewriting;Dassow;Kybernetika,1985
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars;Electronic Proceedings in Theoretical Computer Science;2023-09-03
2. Conclusive Tree-Controlled Grammars;Electronic Proceedings in Theoretical Computer Science;2022-08-27
3. Nonterminal Complexity of Weakly Conditional Grammars;Intelligent Information and Database Systems;2014