Recognition of directed acyclic graphs by spanning tree automata

Authors:
Akio Fujiyoshi
Affiliations:
Department of Computer and Information Sciences, Ibaraki University, 4-12-1 Nakanarusawa, Hitachi, Ibaraki, 316-8511, Japan
Venue:
Theoretical Computer Science
Year:
2010

Citing 10
Cited 0

Combinatorial algorithms on a class of graphs

Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
Linear-time computability of combinatorial problems on series-parallel graphs

Journal of the ACM (JACM)
The recognition of Series Parallel digraphs

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Mathematical Formula Recognition Using Virtual Link Network

ICDAR '01 Proceedings of the Sixth International Conference on Document Analysis and Recognition
The complexity of tree automata and XPath on grammar-compressed trees

Theoretical Computer Science - Implementation and application of automata
Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar

Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Closure properties and decision problems of dag automata

Information Processing Letters
Deterministic recognition of trees accepted by a linear pushdown tree automaton

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	5.23

Visualization

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 the DAG has a spanning tree accepted by the tree automaton. We call this automaton a spanning tree automaton. The NP-completeness of the membership problem of DAGs for spanning tree automata is shown. However, if inputs are restricted to series-parallel graphs or generalized series-parallel graphs, it is shown that the membership problem for spanning tree automata is solvable in linear time.