Archive ouverte HAL

	Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories Luis Barguñó , Carlos Creus , Guillem Godoy , Florent Jacquemard , Camille Vacher Logical Methods in Computer Science, 2013, 9 (2), pp.1-39 Article dans une revue hal-00852382v1
	Rigid Tree Automata and Applications Florent Jacquemard , Francis Klay , Camille Vacher Information and Computation, 2011, 209 (3), pp.486-512. ⟨10.1016/j.ic.2010.11.015⟩ Article dans une revue inria-00578820v1

	The Emptiness Problem for Tree Automata with Global Constraints Luis Barguñó , Carlos Creus , Guillem Godoy , Florent Jacquemard , Camille Vacher 25th Annual IEEE Symposium on Logic in Computer Science (LICS), Jul 2010, Edinburgh, Scotland, United Kingdom. pp.263-272, ⟨10.1109/LICS.2010.28⟩ Communication dans un congrès inria-00578901v1
	Rigid Tree Automata Florent Jacquemard , Francis Klay , Camille Vacher Third International Conference on Language and Automata Theory and Applications, Apr 2009, Tarragona, Spain. pp.446-457, ⟨10.1007/978-3-642-00982-2_38⟩ Communication dans un congrès inria-00579001v1

	Tree automata with global constraints for the verification of security properties Camille Vacher Other [cs.OH]. École normale supérieure de Cachan - ENS Cachan, 2010. English. ⟨NNT : 2010DENS0043⟩ Thèse tel-00598494v1

Camille Vacher