MATHEMATICAL MODELS OF INFORMATION SYSTEMS.
Technical rept. for Oct 66-Oct 67,
MICHIGAN UNIV ANN ARBOR SYSTEMS ENGINEERING LAB
Pagination or Media Count:
The report summarizes several investigations in the development of mathematical models of information processing systems. Particular attention is given to the following algorithm complexity, algorithms with the algebraic complexity for solving the degree constrained subgraph problem, a study of the Shannon switching game, algorithms for the analysis of finite state machines, existence theorems for the realization of finite automata by iterative networks, associative processors, isomorphism invariance of sequential machines, graph theory models of parallel computation, and a probabilistic analysis of sequential machine decomposition. Author
- Computer Hardware