Closure properties and decision problems of dag automata

Authors:
Siva Anantharaman;Paliath Narendran;Michael Rusinowitch
Affiliations:
LIFO, Université d'Orléans, France;University at Albany, Suny;LORIA - Nancy, France
Venue:
Information Processing Letters
Year:
2005

Citing 8
Cited 1

Unification of concept terms in description logics

Journal of Symbolic Computation
Automata theory for XML researchers

ACM SIGMOD Record
The Complexity of Set Constraints

CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
Rewriting for Cryptographic Protocol Verification

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Query Evaluation on Compressed Trees (Extended Abstract)

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Unification Modulo ACUI Plus Distributivity Axioms

Journal of Automated Reasoning
Computation: finite and infinite machines

Computation: finite and infinite machines
Path queries on compressed XML

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29

The complexity of tree automata and XPath on grammar-compressed trees

Theoretical Computer Science - Implementation and application of automata

Quantified Score

Hi-index	0.89

Visualization

Abstract

Tree automata are widely used in various contexts. They are closed under boolean operations and their emptiness problem is decidable in polynomial time. Dag automata are natural extensions of tree automata, operating on dags instead of on trees; they can also be used for solving problems. Our purpose in this paper is to show that algebraically they behave differently: the class of dag automata is not closed under complementation, dag automata are not determinizable, their membership problem is NP-complete, the universality problem is undecidable, and the emptiness problem is NP-complete even for deterministic labeled dag automata.