Tree automata techniques and applications
作者： H. Comon
DOI:
关键词:
摘要:
cnblogs.com参考文章(106)
Gérard P. Huet, Jean-Jacques Lévy, Computations in Orthogonal Rewriting Systems, II. Computational Logic - Essays in Honor of Alan Robinson. pp. 395- 414 ,(1991)
Z. Zachar, The solvability of the equivalence problem for deterministic frontier-to-root tree transducers. Acta Cybernetica. ,vol. 4, pp. 167- 177 ,(1979)
Thierry Heuillard, Max Dauchet, Sophie Tison, Pierre Lescanne, Decidability of the Confluence of Ground Term Rewriting Systems logic in computer science. pp. 353- 359 ,(1987)
Ralf Treinen, The First-Order Theory of One-Step Rewriting is Undecidable rewriting techniques and applications. pp. 276- 286 ,(1996) , 10.1007/3-540-61464-8_59
Jean H. Gallier, Stan Raatz, Wayne Snyder, Theorem Proving Using Rigid E-Unification Equational Matings logic in computer science. pp. 338- 346 ,(1987)
Joost Engelfriet, Heiko Vogler, Fundamental study: modular tree transducers Theoretical Computer Science. ,vol. 78, pp. 267- 303 ,(1991) , 10.1016/0304-3975(91)90353-4
Andreas Podelski, A monoid approach to tree automata. Tree Automata and Languages. pp. 41- 56 ,(1992)
B. Bogaert, S. Tison, Equality and Disequality Constraints on Direct Subterms in Tree Automata symposium on theoretical aspects of computer science. pp. 161- 171 ,(1992) , 10.1007/3-540-55210-3_181
Jean-Claude Raoult, A survey of tree transductions. Tree Automata and Languages. pp. 311- 326 ,(1992)
Prateek Mishra, Towards a Theory of Types in Prolog. SLP. pp. 289- 298 ,(1984)