Abstract
In this paper, we study tree automata for directed acyclic graphs (DAGs). We define the movement of a tree automaton on a DAG so that a DAG is accepted by a tree automaton if and only if a DAG has a spanning tree accepted by a tree automaton. The NP-completeness of the membership problem of DAGs for a tree automaton is shown, and a linear-time recognition algorithm of series-parallel graphs for a tree automaton is presented. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Fujiyoshi, A. (2009). Recognition of a spanning tree of directed acyclic graphs by tree automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5642 LNCS, pp. 105–114). https://doi.org/10.1007/978-3-642-02979-0_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
