How Useful are Dag Automata? - Archive ouverte HAL Accéder directement au contenu
Autre Publication Scientifique Année : 2004

How Useful are Dag Automata?

Résumé

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.
Fichier principal
Vignette du fichier
RR2004-12.pdf (305.84 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-00077510 , version 1 (01-06-2006)

Identifiants

  • HAL Id : hal-00077510 , version 1

Citer

Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch. How Useful are Dag Automata?. 2004. ⟨hal-00077510⟩
371 Consultations
407 Téléchargements

Partager

Gmail Facebook X LinkedIn More