STUDIES IN MATHEMATICAL AUTOMATA THEORY.
Abstract
The report consists of three papers in the fields of Graph and Automata Theory. In the first paper a statistical analysis of maximal communication time in an associated storage processor is presented and an upper bound for the expectation of this quantity is obtained. The problem arose in the design of a parallel processing device which transmits, stores, and receives messages according to a predetermined pattern of traffic. The second paper is concerned with problems of connectivity in a communication network consisting of unreliable nodes and links. Several types of connectivity for a communication network or probabilistic graph are defined and methods for calculating these measures of network performance are investigated. The discussion emphasizes two specific types of networks: the rectangular, and the star-hierarchy network. The third paper is a contribution to the field of automata theory and gives several important theorems relating the concepts of recursiveness to that of computability in a probabilistic machine. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 1967
- Accession Number
- AD0824851
Entities
People
- F. B. Cannonito
- G. E. Cash
- J. L. Bricker
- R. M. Solovay
Organizations
- Hughes Aircraft Company