Title :
An Alpha-State Finite Automaton for Multiplication by Alpha
Author_Institution :
M.I.T. Lincoln Lab. Lexington, Mass.
fDate :
6/1/1962 12:00:00 AM
Keywords :
Automata; Boolean algebra; Character generation; Counting circuits; Equations; Polynomials; Telecommunications; Turing machines;
Journal_Title :
Electronic Computers, IRE Transactions on
DOI :
10.1109/IRETELC.1962.5407929
