Linear finite dynamical systems

Communications in Algebra

Volumn 33, Issue 9, 2005, Pages 2977-2989

  Hernández Toledo, René A ^a  

^a UNIVERSITY OF PUERTO RICO AT CAYEY   (Puerto Rico)

Author keywords

Cycles; Finite dynamical systems; Graph of a map; Trees

Indexed keywords

EID: 31844451923     PISSN: 00927872     EISSN: None     Source Type: Journal    
DOI: 10.1081/AGB-200066211     Document Type: Article

References (10)

1. Cull, P. (1971). Linear analysis of switching nets. Kybernetik 8:31-39.
2. Curtis, C. W. (1991). Linear Algebra. New York: Springer-Verlag.
3. Elspas, B. (1959). The theory of autonomous linear sequential networks. IRE Transactions on Circuit Theory CT-6:45-60.
4. Laubenbacher, R., Pareigis, B. (2001). Equivalence relations on finite dynamical systems. Advances in Applied Mathematics 26:237-251.
5. Lidl, R., Niederreiter, H. (1986). Introduction to Finite Fields and Their Applications. Cambridge: Cambridge University Press.
6. Lidl, R., Niederreiter, H. (1994). Introduction to Finite Fields and Their Applications. Revised Edition. Cambridge: Cambridge University Press.
7. Laubenbacher, R., Stigler, B. (2004). A computational algebra approach to the reverse-engineering of gene regulatory networks. J. Theor. Biol. 229:523-537.
8. Milligan, D. K., Wilson, M. J. D. (1993). The behavior of affine Boolean sequential networks. Connection Sciences. 5(2): 153-167.
9. Shilov, G. E. (1977). Linear Algebra. New York: Dover Publications.
10. Shmulevich, I., Dougherty, E. R., Zhang, W. (2002). From Boolean to probabilistic Boolean networks as models of genetic regulatory networks. Proc. of the IEEE. 90(11):1778-1792.