| dc.contributor.author | Egri-Nagy, A. | |
| dc.contributor.author | Nehaniv, C.L. | |
| dc.date.accessioned | 2011-05-09T09:09:00Z | |
| dc.date.available | 2011-05-09T09:09:00Z | |
| dc.date.issued | 2010 | |
| dc.identifier.citation | Egri-Nagy , A & Nehaniv , C L 2010 , ' On the skeleton of a finite transformation semigroup ' , Annales Mathematicae et Informaticae , vol. 37 , no. 1 , pp. 77-84 . | |
| dc.identifier.issn | 1787-5021 | |
| dc.identifier.other | dspace: 2299/5767 | |
| dc.identifier.uri | http://hdl.handle.net/2299/5767 | |
| dc.description | Original article can be found at : http://www.info.sciverse.com/ Copyright Eszterhazy Karoly College [Full text of this article is not available in the UHRA] | |
| dc.description.abstract | There are many ways to construct hierarchical decompositions of transformation semigroups. The holonomy algorithm is especially suitable for computational implementations and it is used in our software package. The structure of the holonomy decomposition is determined by the action of the semigroup on certain subsets of the state set. Here we focus on this structure, the skeleton, and investigate some of its properties that are crucial for understanding and for efficient calculations. | en |
| dc.language.iso | eng | |
| dc.relation.ispartof | Annales Mathematicae et Informaticae | |
| dc.subject | holonomy algorithm | |
| dc.subject | Krohn-rhodes decomposition | |
| dc.subject | transformation semigroup | |
| dc.title | On the skeleton of a finite transformation semigroup | en |
| dc.contributor.institution | School of Computer Science | |
| dc.contributor.institution | Biocomputation Research Group | |
| dc.contributor.institution | Department of Computer Science | |
| dc.contributor.institution | Centre for Computer Science and Informatics Research | |
| dc.contributor.institution | School of Physics, Engineering & Computer Science | |
| dc.description.status | Peer reviewed | |
| rioxxterms.type | Journal Article/Review | |
| herts.preservation.rarelyaccessed | true | |
