Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. An axiomatic definition of context-free rewriting and its application to NLC graph grammars;Courcelle;Theoret. Comput. Sci.,1987
2. Monadic second-order definable graph transductions: a survey;Courcelle;Theoret. Comput. Sci.,1994
3. The complexity of semilinear sets;Huynh;J. Inform. Process. Cybernetics,1982
4. Linear graph grammars: power and complexity;Engelfriet;Inform. Comput.,1989
5. Complexity of boundary graph languages;Engelfriet;Theor. Inform. Appl.,1990
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献