Author:
Hendrix Joe,Ohsaki Hitoshi
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007),
http://www.grappa.univ-lille3.fr/tata
2. Comon, H., Jacquemard, F.: Ground reducibility is EXPTIME-complete. Information and Computation 187(1), 123–153 (2003)
3. Lecture Notes in Computer Science;P. Devienne,1997
4. Feuillade, G., Genet, T., Viet Triem Tong, V.: Reachability analysis over term rewriting systems. J. Autom. Reasoning 33(3–4), 341–383 (2004)
5. Lecture Notes in Computer Science;T. Genet,2000
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献