Abstract
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.
Partial support for this work by the OPAALS EU project FP6-034824 is gratefully acknowledged.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Egri-Nagy, A., Nehaniv, C.L.: Algebraic hierarchical decomposition of finite state automata: Comparison of implementations for Krohn-Rhodes Theory. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 315–316. Springer, Heidelberg (2005)
Egri-Nagy, A., Nehaniv, C.L.: Cycle structure in automata and the holonomy decomposition. Acta Cybernetica 17, 199–211 (2005) ISSN: 0324-721X
Egri-Nagy, A., Nehaniv, C.L.: Algebraic properties of automata associated to Petri nets and applications to computation in biological systems. BioSystems 94(1-2), 135–144 (2008)
Egri-Nagy, A., Nehaniv, C.L.: SgpDec – software package for hierarchical coordinatization of groups and semigroups, implemented in the GAP computer algebra system, Version 0.5.24+ (2010), http://sgpdec.sf.net
Ganyushkin, O., Mazorchuk, V.: Classical Transformation Semigroups. Algebra and Applications. Springer, Heidelberg (2009)
The GAP Group: GAP – Groups, Algorithms, and Programming, Version 4.4 (2006), http://www.gap-system.org
Kastan, M.B., Kuerbitz, S.J.: Control of G1 arrest after DNA damage. Environ. Health Perspect. 101(Suppl. 5), 55–58 (1993)
Krohn, K., Rhodes, J.L., Tilson, B.R.: The prime decomposition theorem of the algebraic theory of machines. In: Arbib, M.A. (ed.) Algebraic Theory of Machines, Languages, and Semigroups, ch. 5, pp. 81–125. Academic Press, London (1968)
Rhodes, J.: Applications of Automata Theory and Algebra via the Mathematical Theory of Complexity to Biology, Physics, Psychology, Philosophy and Games. World Scientific Press, Singapore (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Egri-Nagy, A., Nehaniv, C.L. (2011). On Straight Words and Minimal Permutators in Finite Transformation Semigroups. In: Domaratzki, M., Salomaa, K. (eds) Implementation and Application of Automata. CIAA 2010. Lecture Notes in Computer Science, vol 6482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18098-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-18098-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18097-2
Online ISBN: 978-3-642-18098-9
eBook Packages: Computer ScienceComputer Science (R0)