Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata

Authors:
Akio Fujiyoshi
Affiliations:
Department of Computer and Information Sciences, Ibaraki University, Ibaraki, Japan 316-8511
Venue:
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Year:
2009

Citing 5
Cited 1

Linear-time computability of combinatorial problems on series-parallel graphs

Journal of the ACM (JACM)
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
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
Tree automata and XPath on compressed trees

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

Recognition of directed acyclic graphs by spanning tree automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

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 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.