Aiserman M., Gusev L., Rozonoer L., Smirnova l., Tal A. Logic, Automata, and Algorithms
Подождите немного. Документ загружается.
420
BIBLIOGRAPHY
169. HOLLAND, L., Cycles and automata behaviour. Preliminary
report. Session on Advanced Theory of Logical Design
of
Dig-
ital Computers, Univ. of Michigan, June, 1958.
170. HUFFMAN, D.
A.,
The synthesis of sequential switching
cir-
cuits, Journ. Franklin Inst., Vol. 257, No. 3-4, 1954.
171.
HUFFMAN, D. A., The design anduse
of
hazard-free switching
networks,
J.
Assoc. Comp. Machines, Vol. 4, January, 1957.
172. HUFFMAN, D.
A.,
Sequential transducer. Papers Buyer’s
Guide, IRE Trans., Vol. CT-6, No. 1, March, 1959.
173. HUMPHREY, W.
S.,
Switching Circuitswith Computer Applica-
tions, John Wiley and Sons,
N.
Y.,
1958.
174. HUZINO, S., On some sequential machines and experiments,
Mem. Fac. Sci.
Kyusyu
University, Vol. A12,
No.
2, 1958.
175. HUZINO, S., Reduction theorems on sequential machines, Mem.
Fac. Sci. Kyusyu Univ., Vol.
A12,
No. 2, 1958.
176. HUZINO,
S.,
On the existence of Scheffer stroke
class
in the
sequential machines, Mem. Fac. Sci.
Kyusyu
Univ., Vol. A13,
No.
2, 1959.
177.
HUZINO,S., Theory of finite automata, Mem. Fac. Sci.
Kyusyu
Univ., Vol. A16, No. 2, 1962.
178. HUZINO,
S.,
Turing transformation and strong computability
of Turing computers, Mem.
Fac.
Sci. Kyusyu Univ., Vol. A13,
No.
2,
1959.
179. HUZINO,
S.,
On some sequential equations, Mem.
Fac.
Sci.
Kyusyu
Univ., Vol. A14, No.
1,
1960.
180. KARNAUGH, M., The map method for synthesis
of
combinator-
ial logic circuits, AIEE Trans., Vol. 72, 1953.
181. KELLER,
H.
B., Finite automata, pattern recognition andper-
ceptrons,
J.
Assoc.
Comp. Machines, Vol. 8, No. 1, 1961.
182. LEE,
C.
I.,
Automata and
finite
automata. Bell Syst. Techn.
Journal, Vol. 39, No. 5, 1960.
183. LEE, C. I., Categorizing automata by W-machine programs,
J.
Assoc. Comp. Machines, Vol.
8,
No.
3, 1961.
184. LOW,
P.
R., and MALEY,
G.
A.,
Flow table logic, Proc.
IRE,
Vol.
49, No. 1, 1961.
185. McCLUSKEY, E. J., Minimization of Boolean functions, Bell.
Syst. Techn. Journ., Vol.
35,
1956.
186. McCLUSKEY, E. J., Minimal
sums
for Booleanfunctions having
many unspecified fundamental products, Communication and
Electronics, No. 63, November, 1962.
187. McNAUGHTON, R. F., and YAMADA, H., Regular expressions
and state graphs for automata, IRE Trans., Vol. EC-9,
No.
1,
1960.
BIBLIOGRAPHY
421
188.
189.
190.
191.
192.
193.
194.
195.
196.
197.
198.
199.
200.
201.
202.
203.
204.
205.
206.
McNAUGHTON, R. F., The theory of automata, a survey. Ad-
vances in Computers, Vol.
2,
ed. by Franz L. Alt, 1962.
MAYEDA,
W.,
Synthesis of switching functions by linear graph
theory,
IBM Journ. of Research and Develop., Vol.
4,
No. 3,
1960.
MEALY,
G.
H.,
A
method of synthesizing sequential circuits,
Bell. Syst. Techn. Journ., Vol. 34, Sept., 1955.
MEZEI,
J.
E., Minimal characterizing experiments
for
finite
memory automata, IRE Trans., Vol. EC-10, No. 2, June, 1961.
MLEZIVA,
M.,
The theory of finite automata (neutral nets),
Rokvoky matematiky, fysiky
a
astronomie, Vol. 5, No. 6, 1960.
MOISIL, G.
C.,
Mathematical logic and modern technology,
Acad. RPR, Inst. de Stud. Romino-Sovietia, 1960.
MOISIL,
G. C.,
Rapport sur
le
developpementdansla
R.
P.
R.
de
la
th6orie des mhcanismes automatiques, Analele Univer-
sitgtii
C.
I.
Pahon, Bucuregti, Seria Acta Logica,No.
1,
1959.
MOISIL,
G.
C.,
Behavior of
a
multistage system with an ideal
relay, Acad. RPR, Bucharest, 1960.
MOORE, E. F.,
A
simplified universal Turing machine, Proc.
Assoc. Comp. Mach., 1953.
MOTT,
T.
H.,
Jr., An algorithmfor determiningminimal nor-
mal forms of an incomplete truth function, Commun. and
Electronics, No. 3, March, 1961.
MULLER,
D.
E., and BARTKY,
W.
S.,
A
theory of asynchronous
circuits, Intern. Symp. on the Theory of Switching.
Part
I.
The
Annals of the Comp. Lab. Harvard Univers., Vol. 29, 1959.
MYHILL,
J.,
Finite automata and the representation of events,
WADC Technical Report, No. 57-624, 1957.
MYHILL,
J.,
Linear bounded automata,
U.
S.
Govt. Research
Reports, Vol. 35, March 10, 1961.
NASLIN,
P.,
Introduction
B
1’6tude
des
automatismes
A
s6-
quences.
1-e
partie, Les fonctions logiques et les circuits
combinatoires,
Automatisme, Vol. 3, No. 1, 1958.
NASLIN, P., Circuits
&
relais
et automatismes sequences,
Dunod,
Paris,
1958.
NASLIN,
P.,
A
note on the simplificationof Boolean functions,
Process Control andAutomation, Vol. 8, No. 6,1961.
NEDELCU, M., Teoria algebrica
a
schemelor
cu
functionare
discreta, Automatica
Yi
electronica, Vol. 4, No. 6,1960.
NERODE,
A.,
Linear automaton transformations, Proc. Amer.
Math. Society, Vol. 9, 1958.
NETHERWOOD,
D.
B., Minimal sequential machines, IRE
Trans., Vol. EC-8, No. 3, 1959.
422 BIBLIOGRAPHY
207.
NEUMANN,
J.
von, The general andlogical theory of automata.
In coll.: Cerebral MechanismsinBehaviour,
N.
Y.,
1951.
208. OTT,
G.,
and FEINSTEIN,
N.
H., Design of sequential machines
from their regular expressions,
J.
Assoc. Comp. Machines,
Vol.
8,
No.
4, 1961.
209.
PXULL,
M.
C.,
and UNGER,
S.
H., Minimizing the number of
states in completely specified sequential switching functions,
IRE
Trans., Vol.
EC-8,
No.
3, 1959.
210. PERCUS,
J.
K.,
Matrix analysis of oriented graphs with
ir-
reducible feedback loops, IRE Trans., Vol. CT-2, 1956.
211. PFEIFEK,
J.
E..
Symbolic logic, Scientific American, Vol.
183,
No.
6, 1950.
212. PHISTER, M., Jr., Logical Design of Digital Computers, John
Wiley
&
Sons,
N.
Y.,
1959.
213. PUTNARI,
H.,
Decidability andessential undecidability, Journ.
Symb. Logic, Vol. 22, 1957.
214.
QUINE,
W.
V., Way to simplify truth functions, Amer. Math.
Monthly, Vol. 62, 1955.
215. RIEGEH,
O
teorii neuronovych siti, Aplikace Matematiky, Vol.
3,
No.
4, 1958.
216. RUTH,
J.
P.,
Minimization of nonsingular Boolean trees,IBM
Journ. of Research and Develop., Vol. 3,
No.
4, 1959.
217. ROTH,
J.
P.,
Minimization over Boolean trees, IBM Journ. of
Research and
Develop.,
Vol. 4, No. 5, 1960.
218. IlOTH,
J.
P., Algebraic topological methods for the synthesis
of
switching systems, I. Trans. Amer. Math. SOC., Vol.
88,
J~ly, 1958.
219. LtUBINOFF,
M.,
Remarks on the design of sequential circuits,
International Symp. on the Theory of Switching,
Part
11. Annals
of
the
Comp.
Lab. HarvardUniversity, Vol. 30,1959.
220.
SCHUBERT, E. J., Matrix algebra of sequential logic, Com-
munic. and Electronics, Vol. 46,
No.
1,
1960.
221. SCHUBERT, E.
J.,
Simultaneous logical equations, Communic.
and Electronics, Vol.
46,
No.
1, 1960.
222. SCHUBEItT,
E.
J., Symnietric switchingfunctions, Communic.
and Electronics, Vol. 46,
No.
1, 1960.
223. SCHOTZENBERGER,
M.
P.,
A
remark on finite transducers,
Information and Control, Vol. 4, No. 2-3, 1961.
224.
SCHUTZENBERGER,
M.
P.,
On the definition of
a
family of
automata, Informationand Control, Vol. 4, No. 2-3,1961.
225. SECHU,
S.,
On
electric
circuits and switching circuits, IRE
Trans.,
“01.
CT-3, 1956; Vol. CT-4, No.
3,
1957.
BIBLIOGRAPHY
423
226. SECHU,
S.,
Mathematical models for sequential machines,
IRE Convent. Record, Vol. 7, part 2, 1959.
227.
SECHU,
S.,
MILLER, R. E., and METZE, G., Transition ma-
trices
of sequential machines, IRE Trans., Vol. CT-6, No.
1,
1959.
228. SEMON,
W.,
Matrix methods in the theory
of
switching, Inter-
national Symposium on the Theory of Switching, Part. 11. Annals
Comp. Lab. Harvard Univ., Vol. 30, 1959.
229. SHANNON, C. E., Von Neumann’s contributions to automata
theory, Bull. Amer. Math. SOC., Vol. 64, part 2, 1958.
230. SHANNON, C. E., Computers and automata, Proc. IRE, Vol.
43, 1953.
231.
SHANNON, C. E.,
A
symbolic analysis of relay and switching
circuits, Trans. AIEE, Vol. 57, 1938.
232. SIMON,
J.
M., Anote on the memory aspect of sequence trans-
ducers, IRE Trans.,
Vol.
CT-6, No. 1, 1959.
233.
SIMON,
J.
M., Some aspects
of
the network analysis of
se-
quence transducers, Journ. Franklin Inst., Vol. 65, June, 1958.
234. SRINIVASAN, C.
F.,
and NARASIMHAN,
R.,
On the synthesis
of
finite sequential machines, Proc. Indian Acad. Sci., Vol.
A50, No. 1, 1959.
235. SRINIVASAN, C.
V.,
State diagram
of
linear sequential ma-
chines, Journ. Franklin Inst., Vol. 273, 1962.
236. SUCHESTON, L., Note on mixing sequences
of
events,
Acta
Mathematica, Acad. Sci. Hung., Vol. 11,fasc. 3-4,1960.
237. SUTO,
S.,
and WATANABE, T., The theory
of
analysis of
se-
quential time switching circuits, Journ. Inst. Electr. Com-
munic. Engrs. (Japan), Vol. 42,
No.
6, 1959.
238. TANG,
D.
T., Analysis and synthesis techniques
of
oriented
communications mts, IRE Trans.,
Vol.
CT-8,
No.
1,1961.
239. TURING,
A.
M., On computable numbers with an application
to the entscheidungsproblem, Proc. London Math. SOC., Vol.
42, 1936-1937. With a correction, Vol. 43, 1947.
240. UNGER,
S.
H., Hazards and delays in asynchronous sequential
switching circuits, IRE Trans., Vol.
CT-6,
No. 1,1959.
241.
URBANO, R. H., and MUELLER,
R.
K.,
A topological method
for
the determination of minimal forms of Boolean functions,
IRE Trans., Vol. EC-5, No. 3, 1956.
242. WALD, A., Sequential Analysis, John Wiley
Sr.
Sons,
N.
Y.,
1947.
243. WANG, HAO, Circuit synthesis by solving sequential Boolean
equations, Zeitschrift
fur
Mathematische Logik und Grund-
lagen der Math., Vol. 5, 1959.
424
244.
245.
246.
247.
248.
249.
250.
251.
252.
2 53.
2
54.
2
55.
256.
2
57.
258.
2
59.
260.
BIBLIOGRAPHY
WANG, HAO,
A
variant to Turing’s theory of computing ma-
chines,
J.
Assoc. Comp. Machines, Vol. 4, Jan.,1961.
WATANABE,
S.,
Five-symbol 8-state and 5-symbol 6-state
universal Turing machines,
Ibid.,
Vol. 8, No. 4, 1961.
WATANABE, S., On
a
minimum universal Turing machine,
MCB Report, Tokyo, 1960.
WHITESITT,
J.
E., Boolean Algebra and Its Applications, Addi-
son-Wesley Pub. Co. Inc., Reading, Mass,, 1961.
SUPPLEMENT
TO
BIBLIOGRAPHY
AIZERMAN,
M.
A.
et al., Transformation of rhythm in
se-
quential machines and the synthesis
of
relay circuits, Avto-
matika
i
Telemekhanika, Vol. 23, No. 11, 1962.
BELYAKIN,
N.
V.,
A
class of Turingmachines, Doklady Akad.
Nauk SSSR, Vol. 148, No.
1,
1963.
BERGE, C., Theory of Graphs andIts Applications, John Wiley
&Sons,
N.
Y., 1962.
BURKS, A., and WRIGHT,
J.,
The theory of logical nets,
Kiberneticheskiy Sbornik, No. 4, IL, Moscow, 1962.
GLUSHKOV,
V.
M.,
The Synthesis of Digital Automata, Fiz-
matgiz Press, Moscow, 1962.
FOZMIDIADI,
V.
A., and CHERNYAVSKY,
V.
S.,
The ordering
of
the
set
of automata, Voprosy Teorii Matem. Machin (a col-
lection), No. 2, 1962.
KORPELEVICH, G. M., The relationship between the concepts
of solvability and enumerability in regard to finite automata,
Doklady Akad. Nauk SSSR,
Vol.
149.
No.
5, 1963.
LEVENSHTEIN,
V.
I., The inversion of finite automata, Dok-
lady Akad. Nauk SSSR, Vol. 147, No. 6, 1962.
LETICHEVSKIY,
A.
A.,
Completeness conditions in the
class
of
Moore’s automata, Materialy nauchnykh seminarov
PO
teoret.
i
prikl. voprosam kibernetiki, Vol.
1,
No.
2,
1963.
LUNTS,
A.
G.,
Finite p-adic automata, Doklady Akad.
Nauk
SSSR, Vol. 150, No. 4, 1963.
MOISIL,
G.
C.,
Algebraic Theory of Automatic Mechanisms,
Pergamon Press,
N.
Y., 1964.
RABIN,
M.
O.,
and SCOTT,
D.,
Finite automata and problems
to be solved, Kiberneticheskiy Sbornik,
No.
4, IL, MOSCOW,
1962.
SIVINSKI, E., The synthesis of multistage systems with delay
elements, Archiwum automatyki
i
Telemechaniki, Vol.
7,
Issue
1-2, 1962.
BIBLIOGRAPHY
425
261. SPIVAK, M. A.,
A
new algorithm for the abstract synthesis
of
automata, Materialy nauchnykh seminarov
PO
teoret.
i
prikl.
voprosam kibernetiki,
Vol.
1,
No.
3,
1963.
262. SHEPHERDSON,
J.
C., Reduction
of
bilateral automata to
unilateral automata, Kiberneticheskiy Sbornik, No. 4, IL,
Mos-
cow, 1962.
263.
YANOV, Yu. I., Identical transformations of regular expres-
sions, Doklady Akad. NaukSSSR, Vol. 147,
No.
2, 1962.
264. ARTHUR,
M.
E.,
Geometric mapping of switching functions,
IRE Trans., Vol. EC-10, No. 4, December, 1961.
265. BAR-HILLEL,
J.,
and SHAMIR, E., Finite-stage languages:
formal representations and adequacy problems, Bull.
Res.
Concil Israel, Vol.
8F,
1960.
266,
BEATTY,
J.,
and MILLER, R. E., Some theorems for incom-
pletely specified sequential machines with application to
state
minimization. Switching Circuits Theory and Logical Design
(Proc. of the Third Annual AIEESymposium), September, 1962.
267. BRZOZOWSKI,
J.
A., and McCLUSKEY, E.
J.,
Signal flow
graph techniques for sequential circuit
state
diagrams,
U.
S.
Government Research Reports, Vol. 37, May 20, 1962.
268. BURKS, A. W., and WRIGHT,
J.
B.,
Sequence generators,
graphs and formal languages, Inform. and Control, Vol.
5,
No.
3,
September, 1962.
269. ELGOT, C. C., andRUTLEDGE,
J.
D., Machine properties pre-
served under
state
minimization. Switching Circuits Theory
and Logical Design (Proc.
of
the Third Annual AIEE Sympo-
sium), September, 1962.
270. GINSBURG,
S.,
and
ROSE, G.
F.,
A
comparison of the work
done by generalized sequential machines and Turing machines,
Trans. Amer. Math. SOC.,
Vol.
103,
No.
3,
1962.
271. GRZEGORCZYK,
A.,
Outline
of
Mathematical Logic, Warsaw,
1961.
2
72. HARTMANIS,
J.,
Maximal autonomous clocks
of
sequential ma-
chines, IRE Trans., Vol. EC-ll, No. 1, 1962.
273. HARTMANIS,
J.,
Loop-free structure
of
sequential machines,
Information and Control, Vol.
5,
No. 1, March, 1962.
274. HARTMANIS,
J.,
The equivalence
of
sequential machine
models, IEEE Trans., Vol. EC-12,
No.
1, February, 1963.
275.
HARTMANIS,
J.,
and STEARNS, R. E., Some dangers in state
reduction of sequential machines, Information and Control,
Vol.
5,
No.
3, September, 1962.
276. JAMADA, H., Disjunctively
linear
logic nets, IRE Trans., Vol.
EC-11, No.
5,
October, 1962.
426
BIBLIOGRAPHY
277. KAUTZ, W.
H.,
Some unsolved problems in switching theory.
Switching Circuits Theory and Logical Design, conference
paper, Detroit, October,
1962.
278. McCLUSKEY, E.
J.,
Jr.,
Minimum state sequential circuitsfor
a
restricted class
of
incompletely specified
flow
tables, Bell
Syst.
Tech.
J.,
Vol.
41,
No.
6,
November,
1962.
279.
NXRASIMIIAN,
It.,
Minimizing incompletely specified sequen-
tial switching functions,
IRE
Trans., Vol.
EC-10,
No.
3,
Sep-
tember,
1961.
280.
SEMITZ,
W.,
and
REEVES, R.,
A
mathematical theory
of
switching circuits, Mathematical Magazine,
Vol. 33,
No.
1,
1959.
281.
SHEPHEHDSOK,
J.
C.,
and
STURCIS,
H.
E.,
Computability
of
recursive functions,
J.
Assoc. Comp. Machines,
Vol.
10,
No.
2,
.Ipril,
1963.
282. WEEG,
G.
P.,
Finite automata and connectionmatrices,
Com-
munications of the ACM, Vol.
3,
No.
7,
1960.
283. WEEG,
G.
P..
and
KATELEY,
J.,
Some propertiesof strongly
connected machines, Communications of the ACM, Vol.
3,
No.
7,
1960.
234. ZEMANEK,
H.,
Sequentielle asynchrone logik, Elektronische
Kechenanlagen, Vol.
4,
No.
6, 1962.
Addenda
to
Bibliography
1.
BABAYEV,
0.
B.
A
method
of
synthesis of many-moment
schemes, Izvestiya Vuzov, Priborostroyeniye, Vol.
7,
No.
6.
1964.
2.
BARZDIN’, YA.
M.
The capacity of
a
medium and the behavior
of automata, Doklady Akad. Nauk, Vol. 160, No.
2,
1965.
3.
BODNARCHUK,
V.
G. Systems of equations in the algebra of
events, Zh. Vychislit. Matemat.
i
Matemat. Fiz., Vol. 3,
No.
6, Nov.-Dec., 1963.
4.
VAVILOV, Ye.
N.
and OSINSKIY, L. M. Structural synthesis of
automata that operate with supplementary moments (in Ukrain-
ian), Avtomatika, No.
2,
1964.
5. GECHEG,
F.
On the group of one-to-one transformations de-
fined by finite automata, Kibernetika, No.
1,
1965.
6. GLUSHKOV,
V.
M.
Introduction to Cybernetics, Acad. Sci.
Press, Ukr. SSR, Kiev, 1964.
7.
GLUSHKOV,
V.
M.
Theory of automata and some applications
of
it, Vestnik Akad. Nauk SSSR, No.
7,
1964.
8.
DOBROV,
D.
Extreme automata, Fiz.-Matem. Spisaniye,
Vol.
7,
No. 1, 1964.
9. Completed works in the field of the theory of relay devices,
finite automata, and coding (1962-1963), Pribory i Sredstva
Avtomatizatsii, No. 10, 1964.
10.
ZAKROVSKIY,
A.
D.
On the shortening
of
sorting in the solu-
tion
of
certain problems in the synthesis of discrete automata,
Izvestiya Vuzov, Radiofizika, 1964, Vol.
7,
No.
1.
11.
ZAROVNYY,
V.
P.
On the group of automatic one-to-one map-
pings, Doklady Akad. Nauk,
Vol.
156, No. 6, 1964.
12.
ZAROVNYY,
V.
P.
Automatic interlacing of groups, Doklady
Akad. Nauk, Vol. 160, No. 3, 1965.
13.
ZYKIN,
G.
P.
A
remark on
a
theorem of Hao Wang, Algebra
i
Logika (Institute of Mathematics of the Siberian Division
of
the Academy of Sciences of the USSR), Vol. 2, No. 1, 1963.
427
428
ADDENDA
TO
BIBLIOGRAPHY
14.
15.
16.
17.
18.
19.
20.
21.
22.
2
3.
2
4.
2
5.
2
6.
2 7.
2
8.
ION,
I.
D.
On the connection between theorems of algorithms
and the abstract theory of automata, Revue de Mathdmatiques
Pures et AppliquGes (BPR), Vol. 8, No. 4, 1963.
KOLMOGOROV,
A.
N.
Discrete automata and
finite
automata
(Text of an address), Proceedings
of
the 4th All-Union
Mathematical Congress, Vol. 1, plenary addresses, Acad.
Sci. Press, Leningrad, 1963.
KRATKO,
M.
I. On the reducibility of acombinatorialproblem
of
Post to certain mass problems in the theory
of
finite auto-
mata, Sbornik Vychislitel’nyye Sistemi, No. 9 Novosibirsk,
1963.
KRIZTKO,
M.
I.
Algorithmic insolvability of
a
problem in the
theory of finite automata, Diskretnyy Analiz,
No.
2, Novosi-
birsk, 1964.
KRATKO,
M.
I. On the existence of nonrecursive bases of
finite automata, Algebra
i
Logika, seminar, Vol. 3,
No.
2,
1964.
KRATKO,
M.
I.
Algorithmic insolvability of problem
of
recognition of completeness
for
finite automata, Doklady
Akad. Nauk, Vol. 155,
No.
1,
1964.
LAZAREV,
V.
G.,
and PIYL’, Ye.
I.
Oncertain classes
of
finite
automata, Zh. Vychislit. Matemat.
i
Matemat. Fiz., Vol.
2,
V.
G. LAZAREV and PIYL’, Ye. I. Synthesis
of
Asynchronic
Finite Automata, Nauka
Press,
1964.
LEVENSHTEYN,
V.
I.
On stable extension of the definition of
partial automata, in the collection: Problemy Kibernetiki, No.
10,
edited by
A. A.
Lyapunov, Fizmatgiz Press, Moscow, 1963.
LETICHEVSKIY,
A.
A.
On the minimization
of
finite automata,
Kibernetika,
No.
1, 1965.
LUNTS,
A.
G.
A
method of analysis
of
finite automata, Doklady
*ad. Nauk, Vol. 160,
No.
4, 1965.
LYUBICH, Yu. I. Estimates for an optimal determination
of
indeterminate autonomous automata, Sibirskiy Matematicheskiy
Zhurnal. Vol. 5, No.
2,
March-April, 1964.
MARKOV,
V.
L.
Turing machines and binary automata,
Sibirskiy Matematicheskiy Zhurnal, Vol. 5, No. 1, January-
February, 1964.
PIYL’,
Ye.
I.
A
method of distribution of internal
states
of
a
finite automation, in the collection: Printsipy Postroyeniya
Setey i Sistem Upravleniya,” Nauka
Press,
Moscow,
1964.
SORKIN, Yu. I. The theory of determining relations for auto-
mata, in the collection: Problemy Kibernetiki,
No.
9, Fiz-
matgiz Press, Moscow, 1963.
NO.
4, July-August, 1962.
ADDENDA
TO
BIBLIOGRAPHY
429
29. SRAGOVICH,
V.
G.
and
Yu.
A.
FLEROV. Construction
of
a
class
of
optimal automata, Doklady Akad. Nauk, Vol. 159, No. 6,
1964.
30. TRAKHTENBROT,
€3.
A.
On an
estimate
of
the weight
of
a
finite tree, Sibirskiy Matematicheskiy Zhurnal, Vol. 5.
No.
1,
January- February, 1964.
31.
The Theory
of
Finite and Probabilistic Automata, Proceedings
of
the International Symposium on the Theory
of
Relay Devices
and Finite Automata (IFAK), Nauka Press, Moscow, 1965.