Author:
Endrullis Jörg,Grabmayer Clemens,Hendriks Dimitri,Klop Jan Willem,de Vrijer Roel
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133–178 (2000)
2. 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
3. Lecture Notes in Computer Science;J. Endrullis,2007
4. Lecture Notes in Computer Science;J. Endrullis,2006
5. Goguen, J.A., Thatcher, J.W., Wagner, E.G., Wright, J.B.: Initial Algebra Semantics and Continuous Algebras. JACM 24(1), 68–95 (1977)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献