IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2009-09-14 11:15
Recognition of a Spanning Tree of DAGs by Tree Automata
Akio Fujiyoshi (Ibaraki Univ.) COMP2009-26
Abstract (in Japanese) (See Japanese page) 
(in English) In this article, we define that a DAG is accepted by a tree automaton if the DAG has a spanning tree accepted by the 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.
Keyword (in Japanese) (See Japanese page) 
(in English) tree automata / spanning tree / directed acyclic graphs / series-parallel graphs / NP-complete / / /  
Reference Info. IEICE Tech. Rep., vol. 109, no. 195, COMP2009-26, pp. 9-12, Sept. 2009.
Paper # COMP2009-26 
Date of Issue 2009-09-07 (COMP) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF COMP2009-26

Conference Information
Committee COMP  
Conference Date 2009-09-14 - 2009-09-14 
Place (in Japanese) (See Japanese page) 
Place (in English) Tottori University of Environmental Studies 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2009-09-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Recognition of a Spanning Tree of DAGs by Tree Automata 
Sub Title (in English)  
Keyword(1) tree automata  
Keyword(2) spanning tree  
Keyword(3) directed acyclic graphs  
Keyword(4) series-parallel graphs  
Keyword(5) NP-complete  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Akio Fujiyoshi  
1st Author's Affiliation Ibaraki University (Ibaraki Univ.)
2nd Author's Name  
2nd Author's Affiliation ()
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker Author-1 
Date Time 2009-09-14 11:15:00 
Presentation Time 35 minutes 
Registration for COMP 
Paper # COMP2009-26 
Volume (vol) vol.109 
Number (no) no.195 
Page pp.9-12 
#Pages
Date of Issue 2009-09-07 (COMP) 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan