Algorithms Enumerating Words of Hamiltonian Surface Flow

Tetsuo YOKOYAMA  Tomoo YOKOYAMA  

Publication
D - Abstracts of IEICE TRANSACTIONS on Information and Systems (Japanese Edition)   Vol.J100-D   No.10   pp.892-894
Publication Date: 2017/10/01
Online ISSN: 1881-0225
Type of Manuscript: LETTER
Category: 
Keyword: 
Hamilton surface flow,  regular expression,  DFA,  topology,  

Full Text(in Japanese): PDF(274.5KB)
>>Buy this Article


Summary: 
Applying the formal language theory, we show that the number of the natural classification of maximal words corresponding to Hamiltonian surface flows is finite, the construction method of algorithms enumerating all the maximal words under each classification, and a method for counting the numbers of maximal words in each classification.