How Useful are Dag Automata?

Siva Anantharaman 1 Paliath Narendran 1, 2 Michaël Rusinowitch 1, 3
3 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 : Tree automata are widely used in various contexts; and their emptiness problem is known to be decidable in polynomial time. Dag automata -- with or without labels -- are natural extensions of tree automata, which can also be used for solving problems. Our purpose in this work is to show that algebraically they behave quite differently: the class of dag automata is not closed under complementation, dag automata are not determinizable, their membership problem turns out to be NP-complete, and universality is undecidable; and proving emptiness is NP-complete even for deterministic labeled dag automata.
Document type :
Other publications
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download
Contributor : Siva Anantharaman <>
Submitted on : Thursday, June 1, 2006 - 5:35:02 PM
Last modification on : Thursday, June 27, 2019 - 1:24:45 AM
Long-term archiving on : Monday, April 5, 2010 - 9:55:48 PM


  • HAL Id : hal-00077510, version 1


Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch. How Useful are Dag Automata?. 2004. ⟨hal-00077510⟩



Record views


Files downloads