Author:
Hoogeboom H. J.,ten Pas P.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference24 articles.
1. Technical Report;H.L. Bodlaender,1996
2. J.R. Büchi, Weak second-order arithmetic and finite automata,Z. Math. Logik Grundlag. Math. 6 (1960), 66–92.
3. P.M. Cohn,Universal Algebra, Harper & Row, New York, 1965.
4. B. Courcelle, An axiomatic definition of context-free rewriting and its application to NLC graphgrammars,Theoret. Comput. Sci. 55 (1987), 141–181.
5. B. Courcelle, The monadic second-order logic of graphs, I: recognizable sets of finite graphs,Inform. Comput. 85 (1990), 12–75.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献