 |
Université d'Orléans |  |
|
Université d'Orléans | |
| HAL : hal-00077510, version 1 |
| Fiche détaillée |  Récupérer au format |
 |
|
|
| How Useful are Dag Automata? |
|
|
| Siva Anantharaman 1Paliath Narendran 1, 2 |
|
|
| (2004) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
| 2 : | Department of Computer Science [Albany] (CS) |
|
|
|
State University of New York at Albany |
|
|
| 3 : | CASSIS (INRIA Lorraine - LORIA / LIFC) |
|
|
|
INRIA – CNRS : FRE2661 – Université de Franche-Comté – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL) |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Informatique et langage |
|
|
| tree automata – labels – determinism – complementation – universality – decidability – complexity – E-Unification. |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00077510, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00077510 | |
| oai:hal.archives-ouvertes.fr:hal-00077510 | |
| Contributeur : Siva Anantharaman | |
| Soumis le : Jeudi 1 Juin 2006, 17:35:02 | |
| Dernière modification le : Mercredi 17 Janvier 2007, 15:29:14 | |
