On straight words and minimal permutators in finite transformation semigroups
| Autor: | Egri-Nagy, A., Nehaniv, C.L. |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2011 |
| Předmět: |
ComputingMilieux_GENERAL
transformation semigroups GeneralLiterature_INTRODUCTORYANDSURVEY practical calculation ComputingMethodologies_DOCUMENTANDTEXTPROCESSING loop-free paths ComputingMilieux_LEGALASPECTSOFCOMPUTING identity transformations semi-group GeneralLiterature_REFERENCE(e.g. dictionaries encyclopedias glossaries) finite transformations Cayley graphs hierarchical decompositions |
| Popis: | “The original publication is available at www.springerlink.com”. Copyright Springer Motivated by issues arising in computer science, we investigate the loop-free paths from the identity transformation and corresponding straight words in the Cayley graph of a finite transformation semigroup with a fixed generator set. Of special interest are words that permute a given subset of the state set. Certain such words, called minimal permutators, are shown to comprise a code, and the straight ones comprise a finite code. Thus, words that permute a given subset are uniquely factorizable as products of the subset's minimal permutators, and these can be further reduced to straight minimal permutators. This leads to insight into structure of local pools of reversibility in transformation semigroups in terms of the set of words permuting a given subset. These findings can be exploited in practical calculations for hierarchical decompositions of finite automata. As an example we consider groups arising in biological systems. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|