Author:
Courcelle B.,Engelfriet J.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference35 articles.
1. Bauderon, M., and Courcelle, B., Graph expressions and graph rewritings,Math. Systems Theory,20 (1987), 83?127.
2. Berstel, J.,Transductions and Context-Free Languages, Teubner Verlag, Stuttgart, 1979.
3. Brandenburg, F. -J., The equivalence of boundary and confluent graph grammars on graph languages of bounded degree,Proc. RTA-91, Lecture Notes in Computer Science, Vol. 488, Springer-Verlag, Berlin, 1991, pp. 312?322.
4. Büchi, J., Weak second-order logic and finite automata,Z. Math. Logik Gründlag. Math.,5 (1960), 66?92.
5. Courcelle, B., Equivalences and transformations of regular systems?applications to recursive program schemes and grammars,Theoret. Comput. Sci.,42 (1986), 1?122.
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Canonisation and Definability for Graphs of Bounded Rank Width;ACM Transactions on Computational Logic;2023-01-18
2. Decidability Results for the Boundedness Problem;Logical Methods in Computer Science;2014-08-15
3. Logical characterization of weighted pebble walking automata;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14
4. Generalizing Parikh’s Theorem;Games, Norms and Reasons;2011
5. On the Monadic Second-Order Transduction Hierarchy;Logical Methods in Computer Science;2010-06-22