Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. J.R. BUCHI, Weak 2nd order logic and finite automata, Z. Math Logik 5(960) 66–92.
2. B. COURCELLE, A representation of graphs by algebraic expressions and its use for graph rewriting systems, this volume.
3. B. COURCELLE, An axiomatic definition of context-free rewriting and its application to NLC grammars, Report 8706, Bordeaux 1 University, 1987.
4. J.DONER, Tree acceptors and applications. Jour. Comput. System Sci. 4(70) 406–451
5. J.W. THATCHER, J.B. WRIGHT, Generalized automata theory, Maths Systems Theory 2 (1970) 57–81
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献