Author:
Bloem Roderick,Engelfriet Joost
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. S. Arnborg, J. Lagergren, D. Seese; Easy problems for tree-decomposable graphs, J. of Algorithms 12 (1991), 308–340
2. A. V. Aho, J. D. Ullman; Translations on a context-free grammar, Inf. and Control 19 (1971), 439–475
3. R. Bloem; Attribute Grammars and Monadic Second Order Logic, Master's Thesis, Leiden University, June 1996
4. J. Büchi; Weak second-order arithmetic and finite automata, Z. Math. Logik Grundlag. Math. 6 (1960), 66–92
5. B. Courcelle, J. Engelfriet; A logical characterization of the sets of hyper-graphs defined by hyperedge replacement grammars, Math. Systems Theory 28 (1995), 515–552
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献