Abstract
The hierarchical algebraic decomposition of finite state automata (Krohn-Rhodes Theory) has been a mathematical theory without any computational implementations until the present paper, although several possible and promising practical applications, such as automated object-oriented programming in software development [5], formal methods for understanding in artificial intelligence [6], and a widely applicable integer-valued complexity measure [8,7], have been described. As a remedy for the situation, our new implementation, described here, is freely available [2] as open-source software. We also present two different computer algebraic implementations of the Krohn-Rhodes decomposition, the V ∪ T and holonomy decompositions [4,3], and compare their efficiency in terms of the number of hierarchical levels in the resulting cascade decompositions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
GAP – Groups, Algorithms, and Programming, a system for computational discrete algebra Version 4.3. (2002), http://www.gap-system.org
Egri-Nagy, A., Nehaniv, C.L.: GrasperMachine, Computational Semigroup Theory for Formal Models of Understanding, experimental software packages (2003), http://graspermachine.sf.net
Eilenberg, S.: Automata, Languages and Machines, vol. B. Academic Press, London (1976)
Krohn, K., Rhodes, J.L., Tilson, B.R.: Algebraic Theory of Machines, Languages, and Semigroups. In: Arbib, M.A. (ed.) The Prime Decomposition Theorem of the Algebraic Theory of Machines, ch. 5, pp. 81–125. Academic Press, London (1968)
Nehaniv, C.L.: Algebraic engineering of understanding: Global hierarchical coordinates on computation for the manipulation of data, knowledge, and process. In: Proc. 18th Annual International Computer Software and Applications Conference (COMPSAC 1994), pp. 418–425. IEEE Computer Society Press, Los Alamitos (1994)
Nehaniv, C.L.: Algebra and formal models of understanding. In: Ito, M. (ed.) Semigroups, Formal Languages and Computer Systems, Kyoto Research Institute for Mathematics Sciences, RIMS Kokyuroku, August 1996, vol. 960, pp. 145–154 (1996)
Nehaniv, C.L., Rhodes, J.L.: The evolution and understanding of hierarchical complexity in biology from an algebraic perspective. Artificial Life 6, 45–67 (2000)
Rhodes, J.L.: Applications of Automata Theory and Algebra via the Mathematical Theory of Complexity to Finite-State Physics, Biology, Philosophy, Games, and Codes. Univ. California Berkeley Math Library (1971) (unpublished book)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Egri-Nagy, A., Nehaniv, C.L. (2005). Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds) Implementation and Application of Automata. CIAA 2004. Lecture Notes in Computer Science, vol 3317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30500-2_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-30500-2_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24318-2
Online ISBN: 978-3-540-30500-2
eBook Packages: Computer ScienceComputer Science (R0)