Thomas N. Hibbard
- 1 MOORE, :EDWARD Gedanken--experiments on sequential machines Annals of Maihemalics Studies No. 34 (Automata Studies), pp. 129-153, Princeton University Press, 1956Google Scholar
- 2 GI~s~vRG, SsY~ova. On the length of the smallest uniform experiment which d~stinguishes the terminal states of a machine. J. A CM 5 (1958), 266-280. Google Scholar
- 3 G{NSBVR~, SEYMOUR. On the reduction of superfluous sf, ates in a sequential machine. J. A CM 6 (1959), 260 Google Scholar
- 4 ttX~FFMA~, D. A. The synthesis of sequential switching circuits J. Franklin Inst 257 (1954), 161-190 and 275-303.Google Scholar
- 5 ME~Lr, G H. A method for synthesizing sequential circuits. Bell System Technical J. 3~ (1955), 1045-1079.Google Scholar
- 6 KARATS~A, A.A. Solutmn of a problem from ~he theory of finite automata. Uspekh~ Matematiki Naul~ 15 (1960), 157-159. Translation No. K-218 for sale by Morris D Friedman, Inc, P.O. Box 35, West Newton 65, Mass.Google Scholar
Index Terms
- Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines
Recommendations
PAC-Bayes bounds for twin support vector machines
Twin support vector machines are regarded as a milestone in the development of support vector machines. Compared to standard support vector machines, they learn two nonparallel hyperplanes rather than one as in standard support vector machines for ...
Improved upper bounds on sizes of codes
Let A(n,d) denote the maximum possible number of codewords in a binary code of length n and minimum Hamming distance d. For large values of n, the best known upper bound, for fixed d, is the Johnson bound. We give a new upper bound which is at least as ...
Comments