CANONICAL FORMS FOR INFORMATION-LOSSLESS FINITE-STATE LOGICAL MACHINES. Technical Report No. 349
Technical Report
·
OSTI ID:4211284
An important class of finite-state machines transforms input sequences of digits into output sequences in a way such that, after an experiment of any finite length on the machine, its input sequence may be deduced from a knowledge of the corresponding output sequence, its initial and final states, and the set of specifications for the transformations by which the machine produces output sequences from input sequences. These machines are called information- lossless.'' Canonical circuit forms are shown into which any information-lossless machines may be synthesized. The existence of inverses for these circuits is investigated and circuits for their realization are derived. (auth)
- Research Organization:
- Massachusetts Inst. of Tech., Cambridge. Research Lab. of Electronics
- NSA Number:
- NSA-13-019453
- OSTI ID:
- 4211284
- Report Number(s):
- NP-7817
- Country of Publication:
- United States
- Language:
- English
Similar Records
Generalized information-lossless automata. I
Generalized information-lossless automata of finite order. II
A programmable finite state module for use with the Fermilab Tevatron Clock
Journal Article
·
Sat Dec 31 23:00:00 EST 1994
· Cybernetics and Systems Analysis
·
OSTI ID:441165
Generalized information-lossless automata of finite order. II
Journal Article
·
Tue Feb 28 23:00:00 EST 1995
· Cybernetics and Systems Analysis
·
OSTI ID:457602
A programmable finite state module for use with the Fermilab Tevatron Clock
Conference
·
Thu Oct 01 00:00:00 EDT 1987
·
OSTI ID:5884371