Author:
Nagaya Takashi,Toyama Yoshihito
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference25 articles.
1. Baader, F, and, Nipkow, T. 1998, Term Rewriting and All That, Cambridge University Press, Cambridge, UK.
2. Sequentiality, second order monadic logic and tree automata;Comon;Inform. and Comput.,2000
3. Comon, H, Dauchet, M, Gilleron, R, Lugiez, D, Tison, S, and, Tommasi, M. Tree automata techniques and applications, Preliminary version, Available on, http://www.grappa.univ-lille3.fr/tata/
4. Bottom-up tree push-down automata: Classification and connection with rewrite systems;Coquidé;Theoret. Comput. Sci.,1994
5. Dershowitz, N.1981, Termination of Linear Rewriting Systems, inProceedings, 8th International Conference on Automata, Languages and Programmings, Lecture Notes in Computer Science, Vol. 115, pp. 448–458, Springer-Verlag, Berlin/New York.
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献