A Note on Partially Ordered Tree Automata

Pierre-Cyrille Héam 1
1 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : A recent paper by Bouajjani, Muscholl and Touili shows that the class of languages accepted by partially ordered word automata (or equivalently accepted by Sigma2-formulae) is closed under semi-commutation and it suggested the following open question: can we extend this result to tree languages? This problem can be addressed by proving 1) that the class of tree regular languages accepted by Sigma2 formulae is strictly included in the class of languages accepted by partially ordered automata, and 2) that Bouajjani and the others results can't be extended to tree.
Complete list of metadatas

Contributor : Jean-Michel Caricand <>
Submitted on : Monday, January 31, 2011 - 9:52:51 PM
Last modification on : Friday, July 6, 2018 - 3:06:10 PM
Long-term archiving on : Sunday, May 1, 2011 - 3:50:54 AM


Files produced by the author(s)



Pierre-Cyrille Héam. A Note on Partially Ordered Tree Automata. Information Processing Letters, Elsevier, 2008, 108 (4), pp.242--246. ⟨10.1016/j.ipl.2008.05.012⟩. ⟨hal-00561271⟩



Record views


Files downloads