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 2013-12-21 15:20
On the minimum consistent DFA problem for prefix samples
Kaori Ueno (Tohokui Univ.), Shinichi Shimozono (Kyushu Inst. of Tech.), Kazuyuki Narisawa, Ayumi Shinohara (Tohokui Univ.) COMP2013-57
Abstract (in Japanese) (See Japanese page) 
(in English) We study the computational complexity of nding the minimum deterministic nite automaton (DFA) that is consistent with given examples, for the case that all examples are pre xes of a single string. We prove that the problem is NP-hard and cannot be approximated within ratio n^(1/21), when the alphabet size |Σ|≧2. Moreover, we present polynomial-time algorithms for |Σ|=1.
Keyword (in Japanese) (See Japanese page) 
(in English) DFA / minimum consistency problem / inapproximability / / / / /  
Reference Info. IEICE Tech. Rep., vol. 113, no. 371, COMP2013-57, pp. 115-122, Dec. 2013.
Paper # COMP2013-57 
Date of Issue 2013-12-13 (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 COMP2013-57

Conference Information
Committee COMP  
Conference Date 2013-12-20 - 2013-12-21 
Place (in Japanese) (See Japanese page) 
Place (in English) Okinawa Industry Support Center 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2013-12-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) On the minimum consistent DFA problem for prefix samples 
Sub Title (in English)  
Keyword(1) DFA  
Keyword(2) minimum consistency problem  
Keyword(3) inapproximability  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Kaori Ueno  
1st Author's Affiliation Tohoku University (Tohokui Univ.)
2nd Author's Name Shinichi Shimozono  
2nd Author's Affiliation Kyushu Institute of Technology (Kyushu Inst. of Tech.)
3rd Author's Name Kazuyuki Narisawa  
3rd Author's Affiliation Tohoku University (Tohokui Univ.)
4th Author's Name Ayumi Shinohara  
4th Author's Affiliation Tohoku University (Tohokui Univ.)
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 2013-12-21 15:20:00 
Presentation Time 25 minutes 
Registration for COMP 
Paper # COMP2013-57 
Volume (vol) vol.113 
Number (no) no.371 
Page pp.115-122 
#Pages
Date of Issue 2013-12-13 (COMP) 


[Return to Top Page]

[Return to IEICE Web Page]


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