Author:
Litovsky Igor,Métivier Yves,Sopena Eric
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. D. Angluin, Local and global properties in networks of processors, Proceedings of the 12th Symposium on Theory of Computing (1980), 82–93.
2. M. Billaud, P. Lafon, Y. Métivier and E. Sopena, Graph Rewriting Systems with Priorities, Lecture Notes in Computer Science 411 (1989), 94–106.
3. B. Courcelle, Recognizable sets of unrooted trees in Definability and Recognizability of sets of trees, Elsevier, to appear (1991).
4. I. Litovsky and Y. Métivier, Computing with Graph Rewriting Systems with Priorities, Fourth International Worshop on Graph Grammars and their Applications to Computer Science, Bremen. Lecture Notes in Computer Science 532 (1991), 549–563.
5. I. Litovsky and Y. Métivier, Computing trees with graph rewriting systems with priorities, in Definability and Recognizability of sets of trees, Elsevier, to appear (1991).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献