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...
Elmentve itt :
| Szerzők: | |
|---|---|
| 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 |
| Tartalmi kivonat: | 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. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 81-95 |
| ISSN: | 0324-721X |