Skip to Main content Skip to Navigation

Closure properties and decision problems of dag automata

Abstract : Tree automata are widely used in various contexts. They are closed under boolean operations and their emptiness problem 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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00077495
Contributor : Siva Anantharaman <>
Submitted on : Wednesday, May 31, 2006 - 8:44:47 AM
Last modification on : Wednesday, January 8, 2020 - 2:17:08 PM

Identifiers

Collections

Citation

Siva Anantharaman, Paliath Narendran, Michael Rusinowitch. Closure properties and decision problems of dag automata. Information Processing Letters, Elsevier, 2005, 94, pp.231--240. ⟨10.1016/j.ipl.2005.02.004⟩. ⟨hal-00077495⟩

Share

Metrics

Record views

124