Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories

Camille Vacher

Luis Barguñó Carles Creus Guillem Godoy Florent Jacquemard Camille Vacher Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories https://doi.org/10.2168/LMCS-9(2:1)2013 http://arxiv.org/abs/1302.6960 2013 Log. Methods Comput. Sci. 9 2 db/journals/lmcs/lmcs9.html#abs-1302-6960

Florent Jacquemard Francis Klay Camille Vacher Rigid tree automata and applications. 486-512 2011 209 Inf. Comput. 3 https://doi.org/10.1016/j.ic.2010.11.015 db/journals/iandc/iandc209.html#JacquemardKV11

Camille Vacher Tree automata with global constraints for the verification of security properties. (Automates d'arbres à contraintes globales pour la vérification de propriétés de sécurité). 2010 École normale supérieure de Cachan, France https://tel.archives-ouvertes.fr/tel-00598494 Luis Barguñó Carles Creus Guillem Godoy Florent Jacquemard Camille Vacher The Emptiness Problem for Tree Automata with Global Constraints. 263-272 2010 LICS https://doi.org/10.1109/LICS.2010.28 https://doi.ieeecomputersociety.org/10.1109/LICS.2010.28 conf/lics/2010 db/conf/lics/lics2010.html#BargunoCGJV10 Florent Jacquemard Francis Klay Camille Vacher Rigid Tree Automata. 446-457 2009 LATA https://doi.org/10.1007/978-3-642-00982-2_38 conf/lata/2009 db/conf/lata/lata2009.html#JacquemardKV09 Luis Barguñó Carles Creus Guillem Godoy Florent Jacquemard Francis Klay