Abstract
By an information processing system we mean quite generally a system capable of receiving information, that is, signals having a well-defined structure, of transferring them, storing them, transforming them, and again delivering them. The nature if such a system is determined, among other characteristics, by the following classification features:
-
1.
the sets of inlets and outlets of the system;
-
2.
the sets of symbols that can appear as parts of the inputs and outputs;
-
3.
the time behaviour of the system: either
-
a)
the moments at which the system works form a countable set (discrete information processing), or
-
b)
the system works continuously (continuous information processing).
-
4.
The relation between input and output of the system: either
-
a)
the output of the system is at any moment uniquely determined (deterministic systems), or
-
b)
the output is, on the chosen level of abstraction, not uniquely determined (non-deterministic or stochastic systems).
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.
Bibliography
10.2 Automata. 10.3 Algorithms
Z. Bubnicki, Identification of control plants (translated from the Polish), Elsevier, Amsterdam-New York, 1972.
S. Eilenberg, Automata, languages, and machines, I, Academic Press, New York-London, 1974.
S. Eilenberg, Automata, languages, and machines. II, Academic Press, New York-London, 1976.
R. J. Nelson, Introduction to automata, Wiley, New York-London, 1968.
P. H. Starke, Abstract automata (translated from the German), North-Holland, Amsterdam-London, 1972.
B. A. Trachtenbrot and N. E. Kobrinskii, Introduction to the theory of finite automata (translated from the Russian), North-Holland, Amsterdam-London, 1965.
A. S. Willsky, Digital signal processing and control and estimation theory, MIT Press, Cambridge, MA, London, 1979.
10.4 Elementary switching algebra
P. R. Adby, Applied circuit theory: matrix and computer methods, Wiley, New York-London, 1980.
R. K. Brayton and R. Spence, Sensitivity and optimization, Elsevier, Amsterdam-New York, 1980.
W. Keister, A. E. Ritchie, and S. H. Washburn, The design of switching circuits, Van Nostrand Rein-hold, New York-London, 1980.
10.5 Simulation and statistical design and optimization of experiments
E. S. Edgington, Randomization tests, Marcel Dekker, New York, 1980.
J. M. Hammersley and D. C. Handscomb, Monte Carlo methods, Methuen, London, 1964.
O. Kempthorne, The design and analysis of experiments, Wiley, New York-London, 1952.
H. B. Mann, Analysis and design of experiments, Dover, New York, 1949.
Rights and permissions
Copyright information
© 1979 Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Bronshtein, I.N., Semendyayev, K.A. (1979). Mathematical information processing. In: Handbook of Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-25651-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-662-25651-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-23574-4
Online ISBN: 978-3-662-25651-0
eBook Packages: Springer Book Archive