Author:
Comon-Lundh Hubert,Jacquemard Florent,Perrin Nicolas
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Alur, R., Chaudhuri, S., Madhusudan, P.: Visibly pushdown tree languages (2006), Available on http://www.cis.upenn.edu/~swarat/pubs/vptl.ps
2. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Babai, L. (ed.) Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), pp. 202–211. ACM Press, New York (2004)
3. Lecture Notes in Computer Science;B. Bogaert,1992
4. Comon, H., Cortier, V.: Tree automata with one memory, set constraints and cryptographic protocols. Theoretical Computer Science 331(1), 143–214 (2005)
5. Comon, H., et al.: Tree Automata Techniques and Applications (1997), http://www.grappa.univ-lille3.fr/tata
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Automata-based verification of programs with tree updates;Acta Informatica;2009-11-21
2. Nested Sibling Tree Automata;RAIRO - Theoretical Informatics and Applications;2009-03-12
3. Rigid Tree Automata;Language and Automata Theory and Applications;2009
4. Parameter Reduction in Grammar-Compressed Trees;Foundations of Software Science and Computational Structures;2009
5. Proving Group Protocols Secure Against Eavesdroppers;Automated Reasoning;2008