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 2017-05-13 15:50
On Equivalence of de Bruijn Graphs and State-minimized Finite Automata
Yoshiaki Takahashi (Solar), Akira Ito (Yamaguchi Univ.) COMP2017-11
Abstract (in Japanese) (See Japanese page) 
(in English) A de Bruijn sequence of order n on the alphabet {0,1} is a cyclic sequence in which every possible string of length n over {0,1} occurs exactly once. In order to enumerate all possible de Bruijn sequences, de Bruijn graphs were introduced.
This study investigates the relationship between de Bruijn graphs and finite automata and proves the structural equality of de Bruijn graph of order n and the state transition diagram for minimum state deterministic finite automaton which accepts regular language (0+1)^*1(0+1)^(n-1) . We also point out that a certain modification of the definition of state equivalence is needed to extend this result to k-ary de Bruijn graphs.
Keyword (in Japanese) (See Japanese page) 
(in English) de Bruijn sequence / de Bruijn graphs / finite automata / state-minimization / / / /  
Reference Info. IEICE Tech. Rep., vol. 117, no. 28, COMP2017-11, pp. 77-83, May 2017.
Paper # COMP2017-11 
Date of Issue 2017-05-05 (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 COMP2017-11

Conference Information
Committee COMP IPSJ-AL  
Conference Date 2017-05-12 - 2017-05-13 
Place (in Japanese) (See Japanese page) 
Place (in English)  
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2017-05-COMP-AL 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) On Equivalence of de Bruijn Graphs and State-minimized Finite Automata 
Sub Title (in English)  
Keyword(1) de Bruijn sequence  
Keyword(2) de Bruijn graphs  
Keyword(3) finite automata  
Keyword(4) state-minimization  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Yoshiaki Takahashi  
1st Author's Affiliation Hofu Science Museum (Solar)
2nd Author's Name Akira Ito  
2nd Author's Affiliation Yamaguchi University (Yamaguchi Univ.)
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
Date Time 2017-05-13 15:50:00 
Presentation Time 30 
Registration for COMP 
Paper # IEICE-COMP2017-11 
Volume (vol) IEICE-117 
Number (no) no.28 
Page pp.77-83 
#Pages IEICE-7 
Date of Issue IEICE-COMP-2017-05-05 


[Return to Top Page]

[Return to IEICE Web Page]


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