The holonomy decomposition of some circular semi-flower automata

Singh Shubh N. and Krishna Kanduru V.: The holonomy decomposition of some circular semi-flower automata. In: Acta cybernetica, (22) 4. pp. 81-95. (2016)

[thumbnail of actacyb_22_4_2016_4.pdf]
Cikk, tanulmány, mű

Download (375kB) | Preview


Using holonomy decomposition, the absence of certain types of cycles in automata has been characterized. In the direction of studying the structure of automata with cycles, this paper focuses on a special class of semi-flower automata and establish the holonomy decomposition of certain circular semiflower automata. In particular, we show that the transformation monoid of a circular semi-flower automaton with at most two bpis divides a wreath produt of cyclic transformation groups with adjoined constant functions.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2016
Volume: 22
Number: 4
ISSN: 0324-721X
Page Range: pp. 81-95
Language: English
Place of Publication: Szeged
Related URLs:
DOI: 10.14232/actacyb.22.4.2016.4
Uncontrolled Keywords: Programozás
Additional Information: Bibliogr.: p. 804-805. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2017. Mar. 16. 14:35
Last Modified: 2022. Jun. 20. 13:26

Actions (login required)

View Item View Item