Cycle structure in automata and the holonomy decomposition

Egri-Nagy, Attila and Nehaniv, Chrystopher L.: Cycle structure in automata and the holonomy decomposition. Acta cybernetica, (17) 2. pp. 199-211. (2005)

[img] Cikk, tanulmány, mű

Download (183kB)


The algebraic hierarchical decomposition of finite state automata can be applied wherever a finite system should be 'understood' using a hierarchical coordinate system. Here we use the holonomy decomposition for characterizing finite automata using derived hierarchical structure. This leads to a characterization according to the existence of different cycles within an automaton. The investigation shows that the problem of determining holonomy groups can be reduced to the examination of the cycle structure of certain derived automata. The results presented here lead to the improvements of the decomposition algorithms bringing closer the possibility of the application of the cascaded decomposition for real-world problems.

Item Type: Article
Event Title: Conference for PhD Students in Computer Science, 4., 2004, Szeged
Journal or Publication Title: Acta cybernetica
Date: 2005
Volume: 17
Number: 2
Page Range: pp. 199-211
ISSN: 0324-721X
Language: angol
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: p. 210-211.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Jun. 05. 14:50

Actions (login required)

View Item View Item