Coding of the Internal States of a Finite Automation,
Abstract
The present treatment examines the state assignment problem in finite automata from the aspect of obtaining faultless automaton operation together with economic structure of the logic converter. The present work treats this state assignment with the following restrictions: (a) the breakdowns in elementary automata are independent; (b) they have the same probability; (c) the probabilities of breakdowns of the indicated types are equal, i.e., the breakdowns are symmetrical; (d) the input effects are assumed to be error-free. The sequence in which the methods of state assignment are chosen which ensure faultless operation and simultaneously evaluate the complexity of excitation functions of the elementary automata are given.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 05, 1970
- Accession Number
- AD0868562
Entities
People
- N. Doncheva
Organizations
- National Air and Space Intelligence Center