Abstract
In the sequel X will always denote a finite, generally very large set*, and F will denote a map of X into itself.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Robert, F. (1986). Discrete Iterations and Automata Networks: Basic Concepts. In: Discrete Iterations. Springer Series in Computational Mathematics, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61607-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-61607-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64882-3
Online ISBN: 978-3-642-61607-5
eBook Packages: Springer Book Archive