The holonomy decomposition of some circular semi-flower automata

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 semi...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Singh Shubh N.
Krishna Kanduru V.
Dokumentumtípus: Cikk
Megjelent: 2016
Sorozat:Acta cybernetica 22 No. 4
Kulcsszavak:Programozás
Tárgyszavak:
doi:10.14232/actacyb.22.4.2016.4

Online Access:http://acta.bibl.u-szeged.hu/46420
LEADER 01327nab a2200241 i 4500
001 acta46420
005 20220620132623.0
008 170316s2016 hu o 0|| eng d
022 |a 0324-721X 
024 7 |a 10.14232/actacyb.22.4.2016.4  |2 doi 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Singh Shubh N. 
245 1 4 |a The holonomy decomposition of some circular semi-flower automata  |h [elektronikus dokumentum] /  |c  Singh Shubh N. 
260 |c 2016 
300 |a 81-95 
490 0 |a Acta cybernetica  |v 22 No. 4 
520 3 |a 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. 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Programozás 
700 0 1 |a Krishna Kanduru V.  |e aut 
856 4 0 |u http://acta.bibl.u-szeged.hu/46420/1/actacyb_22_4_2016_4.pdf  |z Dokumentum-elérés