Aiserman M., Gusev L., Rozonoer L., Smirnova l., Tal A. Logic, Automata, and Algorithms
Подождите немного. Документ загружается.
41 0
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
2
3.
24.
2
5.
2 6.
2
7.
5
I8
LI
OG
RAPHY
BERENDS, T.
K.
and TAL’,
A.
A., Pneumatic relay schemes,
Avtomatika
i
Telemekhanika, Vol. 20, No.
11,
1959.
BLOCH,
A.
Sh., Synthesis of multistage circuits, Sbornik Trudov
Instituta Mashinovedeniya
i
Avtomatizatsii AN BSSR, No. 1,
1961.
BLOCH,
A.
Sh., A canonical method
for
the synthesis of
elec-
tronic circuits. Sbornik Trudov Instituta Mashinovedeniya
i
Avtomatizatsii AN BSSR,
No.
1, 1961.
BLOCH,
A.
Sh., The synthesis
of
relay contact circuits, Dok-
lady Akad. Nauk SSSR, Vol. 117,
No.
4,
1957.
BLOCH,
A.
Sh., Problems solvable by sequential machines,
Problemy Kibernetiki (a collection), No.
3,
Fizmatgiz
Press,
Moscow, 1960.
BLOCH,
A.
Sh., A canonical method for the synthesis
of
contact
circuits, Avtomatika i Telemekhanika, Vol. 22, No. 6,1961.
WANG HA0 and McNAUGHTON, R., Axiomatic Systems in Set
Theory, IL, Moscow, 1963.
VAVILOV,
E.
N., and OSINSKY,
L.
M.,
Amethod for the struc-
tural synthesis of finite automata, Avtomatika,
No.
2.1963.
GAVRILOV,
M.
A.,
The present state of the
art
and fundamental
trends in the development of the theory of relay circuits, Papers
on the All-Union Conference on the Theory of Relay Devices,
(a collection), Acad. Sci. Press, Moscow, 1957.
GAVRILOV,
M.
A.,
The Theory of Relay Contact Circuits, Acad.
Sci. Press, Moscow-Leningrad, 1950.
GAVRILOV,
M.
A., The structural theory
of
relay devices
(a
lecture). VZEI, part 1, 1959; part
2,
1960; part
3,
1961. VZEI
Press.
GAVRILOV,
M.
A., Minimization
of
Boolean functions charac-
terizing relay networks, Avtomatika
i
Telemekhanika, Vol.
20,
No. 9, 1959.
HILBERT,
D.,
and ACKERMANN,
W.,
Principles of Mathemati-
cal Logic, Chelsea Publishing Co.,
N.
Y.
GINSBURG,
S.,
The length
of
the shortest experiment determin-
ing the terminal
states
of
a
machine, Kiberneticheskiy Sbornik
No.
3,
IL, Moscow, 1961.
GLEBSKY,
Yu.
V., Coding with the aid of automata with
a
finite
internal memory, Problemy Kibernetiki (a collection), No. 7,
Fizmatgiz Press, Moscow, 1962.
GLUSHKOV,
V.
M.,
Abstract theory of automata, Uspekhi
Matem. Nauk, Vol. 16,
NO.
5
(lo),
1961; Vol. 17,
No.
2 (104\,
1962.
BIBLIOGRAPHY
41
1
28.
29.
30.
31.
32.
33.
34.
35.
36.
37.
38.
39.
40.
GLUSHKOV,
V.
M., Some synthesis problems of digital auto-
mata, Zh. Vychislit. Matemat. i Matem. Fiz., Vol.
1,
No.
3,
May-June, 1961.
GLUSHKOV,
V.
M.,
Abstract automata and splitting of the
free
semigroups, Doklady Akad. Nauk SSSR,
Vol.
136, No.
4,
1961.
GOODSTEIN, R. L., Mathematical Logic,
A
collection, edited
and prefaced by
S.
A.
Yanovskaya, IL, Moscow, 1961.
DAVIS,
M.
D.,
A
note on universal Turingmachines, Automata
(a
collection), edited by
C.
E. Shannon and
J.
McCarthy, IL,
Moscow, 1956;
see
also:
Shannon,
C.
E. and
J.
McCarthy, Auto-
mata Studies, Princeton University Press, Princeton,
N.
J.,
1956.
ZHURAVLEV, Yu.
I.,
Various concepts of the minimality of dis-
junctive normal forms, Sibirsky Matem. Zh., Vol.
1,
No. 4,
November-December, 1960.
ZHURAVLEV,
Yu.
I.,
Separability
of
subsets of the vertices of
an n-dimensional unit cube, Trudy Matem. In-ta im.
V.
A.
Stek-
lova, Vol. 51, Acad. Sci.
Press,
1958.
ZAVOLOKINA,
Z.
I.,
Magnetic Elements in Digital Computers,
Gosenergoizdat
Press,
Moscow-Leningrad, 1958.
ZAKREVSKIY,
A.
D., Minimization of structural formulas of
mu1 ti stage circuits
,
Trudy Sibir skogo Fizi ko- Tekhniche skogo
In-ta pri Tomskom Gos. Universitete im. Kuybysheva,
No.
40,
1961.
ZAKREVSKIY,
A.
D., The synthesis of sequential automata,
Trudy Sibirskogo F’iziko-Tekhnicheskogo Instituta No. 40,1961.
KAZAKOV,
V.
D., and KUZNETSOV,
0.
P.,
List of foreign
works on the theory of relay action devices and finite automata
for the year 1958, Avtomatika
i
Telemekhanika, Vol.21, No. 9,
1960; List of Soviet works
on
the theory
of
relay circuits and
finite automata for the year 1959, Avtomatikai Telemekhanika,
Vol.
22,
No.
2,
1961; Vol.
24,
No.
5,
1963.
KOL’MAN, E., The significance of symbolic logic, Studies in
Logic.
A
collection edited by
E.
Kol’man et
al.,
Acad. Sci.
Press,
Moscow, 1959.
CULBERTSON,
J.
T., Some uneconomical robots, Automata.
A
collection edited by
C.
E. Shannon and
J.
McCarthy, IL,
Mos-
cow, 1956;
see
also Culbertson,
J.
T., Minds of Robots,
U.
of
Illinois
Press,
Urbana,
Ill.,
1963; also: Shannon,
C.
E. and
J.
McCarthy, Automata Studies, Princeton University
Press,
Princeton,
N.
J., 1956.
KARATSUBA,
A.
A., Solution of aproblem of the theory
of
finite
automata, Uspekhi Matem. Nauk.,Vol. 15, No.
3.,
1960.
412
BIBLIOGRAPHY
41. KLEENE,
S.
C.,
Representation of events in nerve nets and
finite automata, Automata. A collection edited by
C.
E. Shannon
and
J.
McCarthy, IL, Moscow, 1956;
see
also: Shannon, C. E.
and
J.
McCarthy, Automata Studies, Princeton University Press,
Princeton,
N.
J., 1956.
42.
KLEENE, S.
C.,
Introduction to Metamathematics, D. Van
Nos-
trand Publishers,
N.
y., 1952.
43. KOBRINSKY,
N.
E., and TRAKHTENBROT, B. A., The construc-
tion of a general theory of logical networks. Studies in Logic.
A
collection edited by E. Kol’manet al., Acad.
Sci.
Press, Mos-
cow, 1959,
44. KOBRINSKY,
N.
E., and TRAKHTENBROT, B. A., Introduction to
the theory of Finite Automata, Fizmatgiz Press, Moscow, 1961.
45. CALDWELL,
S.,
Logical Synthesis of Relay Devices, IL,
Mos-
cow, 1961;
see
Caldwell,
S.
H., Switching Circuits and Logical
Design, John Wiley
&
Sons,
N.
Y., 1958.
46. COPE, I. M., ELGOT, C.
C.,
and WRIGHT,
J.
B.,
Realization of
events in logical nets, Kiberneticheskiy Sbornik, No. 3, IL,
Moscow, 1961.
47. KUDRYAVTSEV,
V.
B.,
Completeness theorem for one class
of loop-free automata, Doklady Akad. Nauk SSSR,
Vol.
132,
No.
2, 1960.
48. KUDRYAVTSEV,
V.
B.,
Problems of completeness relating to
systems of automata, Doklady Akad. NaukSSSR, Vol. 130, No. 6,
1960.
49. KAZAREV,
V.
G.,
and PIYL’, E.
I.,
Amethod
for
the synthesis
of
finite automata, Avtomatika
i
Telemekhanika, Vol. 22, No. 9,
1961.
50.
LAZAREV,
V.
G.,
A
method
for
determination of the number
of relays necessary
for
the construction of relay circuits from
given operation conditions, Problemy Peredachi Informatsii,
No. 1, Acad. Sci. Press, 1959.
51.
LAZAREV,
V.
G., Determination of the minimal number
of
in-
termediate relays in the synthesis of multistage circuits,
Sbor-
nik rabot
po
provodnoy svyazi,
No.
5, Acad. Sci. Press, 1956.
52. LAZAREV,
V.
G.
and PIYL’, E.
I.,
Reduction
of
the number of
states in one class
of
finite
automata, Doklady Akad. Nauk SSSR,
Vol. 143, No. 5, 1962.
53. LETICHEVSKY,
A.
A., Synthesis of
finite
automata, Doklady
Akad. Nauk UkrSSR, Vol. 11, No. 2, 1961.
54. LETICHEVSKY,
A.
A., Conditions
of
completeness for finite
automata, Zh. Vychislit. Matemat.
i
Matem. Fiz.,Vol.l, No.
4,
1961.
BIB
LlOG
RAPHY
413
55. LUNTS,
A.
G.,
Application of matrix Boolean algebra to the
analysis and synthesis of relay contact circuits, Doklady Akad.
Nauk SSSR, Vol. 70, No. 3, 1950.
56. LUPANOV,
0.
B.,
Asymptotic evaluation of the number of graphs
and networks with
n
edges, Problemy Kibernetiki
(a
collection),
No. 4,'Fizmatgiz Press, Moscow, 1960.
57. LUPANOV,
0.
B.,
A
method for circuit synthesis, Izvestiya
Vuzov, Radiofizika, No. 1, 1958.
58. LUPANOV,
0.
B.,
The possibilities of synthesis of circuits
from arbitrary elements, Trudy Matem. Instituta im.
V.
A.
Steklova, Vol. 51, Acad. Sci.
Press,
1958.
59. LUPANOV,
0.
B.,
The possibilities of synthesis of circuits
from diverse elements, Doklady Akad. Nauk SSSR, Vol. 103,
No. 4, 1955.
60. LUPANOV,
0.
B., Realization of the algebra of logic functions
by finite
class
formulas (by formulas of bounded depth on the
basis
of
&,
V,
-
),
Problemy Kibernetiki
(a
collection), No.
6,
1961.
61. LUPANOV,
0.
B.,
The principle of local codingand realization
of functions of
certain
classes
by circuits of functional elements,
Doklady Akad. Nauk SSSR, Vol. 140,
No.
2, 1961.
62. McCULLOCH,
W.
S.,
and PITTS,
W.,
A
logical calculus of the
ideas related to nervous activity, Automata.
A
collection edited
by
C.
E. Shannon and
J.
McCarthy, IL, Moscow, 1956;
see
also:
Shannon, C.
E.
and
J.
McCarthy, Automata Studies, Princetan
University Press, Princeton,
N.
J.,
1956.
63. McCARTHY,
J.,
The inversion of functions defined by Turing
machines, Automata.
A
collection edited by C.
E.
Shannon and
J.
McCarthy, IL, Moscow, 1956;
see
also:
Shannon,
C.
E.
and
J.
McCarthy, Automata Studies, Princeton University Press,
Princeton,
N.
J.,
1956.
64. MARKOV,
A.
A., The algorithm theory, Trudy Matem. Instituta
im.
V.
A.
Steklova, Vol. 42, 1954.
65. MARKOV,
A.
A.,
Mathematical logic and computer mathematics,
Vestnik
AN
SSSR, No.
8,
1957.
66. MARTYNYUK,
V.
V.,
Relationship between the memory and
cer-
tain potentialities of
a
finite automaton, Problemy Kibernetiki
(a
collection), No. 5, Fizmatgiz
Press,
Moscow, 1961.
67. MEDVEDEV, Yu. T.,
A
class
of events representable in
a
finite
automaton, Supplement to Automata.
A
collection edited by
C.
E.
Shannon and
J.
McCarthy, IL, Moscow, 1956;
see
Shannon,
C.
E.
and
J.
McCarthy, Automata Studies, Princetonuniversity
Press,
Princeton,
N.
J.,
1956.
414
BIBLIOGRAPHY
68.
69.
70.
71.
72.
73.
74.
7
5.
76.
77.
78.
79.
80.
81.
MEKLER,
Ya.
I.,
Simplification
of
the algebraic synthesis
of
relay circuits, Avtomatika
i
Telemekhanika, Vol. 19, No. 12,
1958.
MINSKIY,
M.
L.,
Some universal elements
for
finite automata,
Supplement to Automata.
A
collection edited by
C.
E. Shannon
and
J.
McCarthy, IL, Moscow, 1956;
see
Shannon,
C.
E. and
J.
McCarthy, Automata Studies, Princeton University Press,
Princeton,
N.
J.,
1956.
MOISIL,
G. C.,
Algebraic theory of the operation of
real
relay
contact circuits, Papers on the All-Union Conference on the
Theory
of
Relay Devices
(a
collection), Acad. Sci.
Press,
1957.
MOISIL, G.
C.,
and IOANIN,
G.,
Synthesis ofrelay contact
cir-
cuits
for
given operation conditions
of
the executive elements,
Zh. Chistoy i Priklad. Matemat., Akad. RNR, Vol.
1,
No.
2,
1956.
MOORE, E. F., Gedanken-experiments on sequential machines,
Automata.
A
collectionedited by
C.
E.
Shannon and
J.
McCarthy,
IL, Moscow, 1956; see Shannon,
C.
E. and
J.
McCarthy, Auto-
mata Studies, Princeton University
Press,
Princeton,
N.
J.,
1956.
NEUMANN (von)
J.,
Probabilistic logics and the synthesis
of
reliable organisms from unreliable components, Automata.
A
collection edited by
C.
E. Shannon and
J.
McCarthy, IL, Moscow,
1956;
see
Shannon, C. E. and
J.
McCarthy, Automata Studies,
Princeton University Press, Princeton,
N.
J.,
1956.
NECHIPORUK, E.
I.,
The synthesis of R-circuits, Doklady Akad.
Nauk SSSR, Vol. 137,
No.
5, 1961.
NOVIKOV,
P.
S.,
Elements
of
Mathematical Logic,Fizmatgiz
Press, Moscow, 1959.
OSTIANU,
V.
M.,
and TOMFEL’D, Yu. L., One application
of
mathematical logic, Uch. Zapiski Kishinevskogo
Gos.
Un-ta,
Vol. 29, 1957.
PETER, R., Recursive Functions, Pergamon
Press,
N.
Y.
POVAROV,
G.
N.,
The logical synthesis of electronic computer
and control circuits. Studies in Logic, edited by E. Kol’man
et al., Acad. Sci.
Press,
1959.
POVAROV,
G.
N.,
The symmetry
of
Boolean functions, Trudy
Vsesoyuznogo Matematicheskogo ~”yezda, Vol. 4 (abrief sum-
mary
of
the papers), Acad. Sci.
Press,
1959.
POVAROV,
G.
N.,
Functional separability
of
Booleanfunctions,
Doklady Akad. Nauk SSSR, Vol. 94, No. 5, 1954.
POVAROV,
G.
N.,
The study of symmetrical Boolean functions
from the viewpoint
of
relay contact circuits, Doklady Akad.
Nauk SSSR, Vol. 104, No.
2,
1955.
BIBLIOGRAPHY
41
5
82. POVAROV,
G.
N.,
The structural theory of communicationnet-
works, Problemy Peredachi Informatsii
(a
collection), No. 1,
Acad. Sci.
Press,
1959.
83. PARKHOMENKO,
P.
P.,
Block analyzer of relay circuits,
Tekhnicheskiye Sredstva Avtomatizatsii i Telemekhaniki
(a
collection), No. 14, Moscow, 1961.
84. POPOVICH,
K.,
Minimal disjunctive form of Booleanfunctions,
Papers on the All-Union Conference on the Theory of Relay
De-
vices
(a
collection), Acad. Sci.
Press,
1957.
85. POSPELOV,
D.
A.,
Arithmetical and Logical Principles of Dig-
ital Computers,
Part
I: Arithmetical and logical principles of
digital computers; Part 11: Algebra
of
logic functions, the
synthesis and analysis
of
circui
ts having time-independent oper-
ation, ME1
Press,
Moscow, 1960.
86.
Use
of Logic in Science and Technology.
A
collection edited by
P.
V.
Tavanets et al., Acad. Sci.
Press,
1960.
87. ROGINSKIY,
V.
N.,
Elements of the Structural Synthesis
of
Relay Control Circuits, Acad. Sci.
Press,
1959.
88. ROGINSKIY,
V.
N., Equivalent transformations of relay circuits,
Sbornik nauchnykh rabot
PO
provodnoy svyazi,
No.
6,1957.
89. ROGINSKIY,
V.
N.,
A
graphical method for the construction of
contact circuits, Elektrosvyaz’
,
No,
11,
1957.
90. RANI,
J.
N.,
Sequential functions, Kiberneticheskiy Sbornik, No.
3, IL, Moscow, 1961.
91.
A
collection
of
articles on mathematical logic and its applica-
tion to certain problems of cybernetics, Trudy Matem. Instituta
im.
V.
A.
Steklova, Vol. 51, Acad. Sci.
Press,
1958.
92. SKORNYAKOV, L. A.,
A
class
of automata (neutral nets)
Problemy Kibernetiki (a collection), No.
4,
Fizmatgiz Press,
Moscow, 1960.
93. SOKOLOV,
0.
B.,
The construction of functionally stable auto-
mata, Summary
of
1960 scientific conference of the Kazan’
State University, Kazan’, 1960.
94. SORKIN, Yu. I., Algorithmic solvability of the isomorphism
problem in relation to automata, Doklady Akad. Nauk SSSR, Vol.
137,
No.
4,
1961.
95.
STOGNIY,
A. A.,
The synthesis
of
an abstract automaton from
the event representable by it, Zh. Vychislit. Matemat.
i
Matem.
Fiz., Vol.
1,
No.
3, 1961.
96. TARSKI,
A.,
Introduction to Logic and to the Methodology of
Deductive Sciences, 2nded. rev. 1946; 3rded. Oxford University
Press.
97. TRAKHTENBROT, B.
A.,
Algorithms and Mechanical Solution
of Problems, Fizmatgiz Press, Moscow, 1957.
416
BIBLIOGRAPHY
98. TRAKHTENBROT, B.
A.,
Operators realizable in logic nets,
Doklady Akad. Nauk SSSR, Vol.
112,
No. 6, 1957.
99. TRAKHTENBROT, B.
A.,
The synthesis
of
logical nets whose
operators
are
described by means
of
one-place predicate
cal-
culus, Doklady Akad. Nauk
SSSR,
Vol. 118, No. 4, 1958.
100. TRAKHTENBROT, B. A., Asymptotic estimate of the complex-
ity
of
logical nets with
a
memory, Doklady Akad. Nauk
SSSR,
Vol.
127,
No. 2, 1959.
101. TRAKHTENBROT,
B.
A.,
Some constructions in one-place
predicate logic, Doklady Akad. Nauk SSSR, Vol. 138, No. 2,
1961.
102. TRAKHTENBROT,
B.
A., Finite automata and one-place
predicate logic, Doklady Akad. Nauk SSSR, Vol. 140, No. 2,
1961.
103. USPENSKIY, B. A., Lectures on Computable Functions, Fizmat-
giz
Press,
Moscow, 1960.
104. FEL’DBAUM,
A.
A., Computers in Automatic Systems,
Fizmatgiz
Press,
Moscow, 1959.
105. KHARKEVICH,
A. D.,
Commutational circuits and their logic.
Studies in Logic (a collection), Acad. Sci.
Press,
1959.
106. TSEYTIN,
G.
S.,
Algorithmic operators in constructive metric
spaces, Trudy Matem. In-ta im.
V.
A. Steklova, Vol.
67,
1962.
107. TSETLIN,
M.
L.,
Imprimitive circuits, Problemy Kibernetiki
(a
collection), No.
1,
Fizmatgiz, 1958.
108. TSETLIN,
M.
L., Some problems relating to the behavior
of
finite automata, Doklady Akad. Nauk SSSR, Vol. 139,
NO.
4,
1961.
109. CHURCH, A., Introduction to Mathematical Logic, Princeton
University Press, Princeton,
N.
J.,
1956.
110. SHANNON,
C.
E., Auniversal Turingmachine with
two
internal
states, Automata.
A
collection edited by
C.
E.
Shannon and
J.
McCarthy, IL, Moscow, 1956;
see
Shannon,
C.
E.
and
J.
McCarthy, Automata Studies, Princeton University
Press,
Princeton,
N.
J.,
1956.
111.
SHESTAKOV,
V.
I.,
An algebraic method
for
the analysis
of
autonomous systems
of
two-position relays, Avtomatika
i
Telemekhanika, Vol. 15, No. 2,1954; Vol.
15,
NO.
4, 1954.
112.
SHESTAKOV,
V.
I.
,Vectorial-algebraic method
for
the analysis
and synthesis
of
multistage relay circuits, Trudy I11 VSeSOyUz-
nogo Matematicheskogo ~”yezda, Vol.
1,
1956.
113. SHREYDER,
Yu. A.,
The problem
of
dynamic planning and
automata, Problemy Kibernetiki
(a
collection), No. 5, Fizmat-
giz
Press,
Moscow, 1961.
81
BLIOGRAPHY
41
7
114. ASHBY,
W.
R., Introduction to Cybernetics, John
Wiley
and
Sons,
N.
Y., 1956.
115. YABLONSKIY,
S.
V., Functional constructions in many-valued
logics, Trudy I11 Vsesoyuznogo Matematicheskogo S”yezda,
Vol.
2,
Acad. Sci. Press, 1956.
116. YABLONSKIY,
S.
V., On boundary logics, Doklady Akad. Nauk
SSSR, Vol. 118, No. 4, 1958.
117.
YABLONSKIY,
S.
V.,
Algorithmic difficulties in the synthesis
of minimal contact circuits, Problemy Kibernetiki
(a
collec-
tion), No. 2, Fizmatgiz Press, Moscow, 1959.
118. YANOVSKAYA,
S.
A.,
Some features of mathematicallogic and
its relation to technical applications.
Use
of Logic in Science
and Technology
(a
collection), Acad. Sci.
Press,
1960.
119. YANOVSKAYA,
S.
A.,
Mathematical logic and
the
foundations
of mathematics. Mathematics in USSR over 40
Years
(1917-
1957)
[a
collection], Vol.
1,
Fizmatgiz
Press,
Moscow, 1959.
120. ABHYANKAR,
S.,
Minimal ‘‘sum of products of sum” expres-
sion of Boolean functions, IRE Trans., Vol. EC-7, No. 4, 1958.
121. ABHYANKAR,
S.,
Absolute minimal expressions of Boolean
functions, IRE Trans., Vol. EC-8, No. 1, 1959.
122. ARANT,
G.
W., A
time-sequential tabular analysis
of
flip-flop
logical operation, IRE Trans., Vol. EC-6, June, 1957.
123. ARBIB,
M.,
Turing machines,
finite
automata andneural nets,
J.
Assoc. Cornp. Machines, Vol.
8,
No. 4, 1961.
124. ARDEN,
D.,
Delayed logic and finite state machines. Sympo-
sium on Switching Circuit Theory and Logical Design, AIEE,
Detroit, Michigan, October, 1961.
125. AUFENKAMP,
D.
D., and HOHN, F. E., Oriented graphs and
sequential machines, Bell Laboratories Reports, 30,1954.
126. BALDA,
M.,
Classification of automata, Automatizace, Vol.
4,
No. 2, 1961.
127. BEATSON, T.
J.,
Minimization of components in electronic
switching circuits, Communication and Electronics, No. 4,
July, 1958.
128. BELLMAN, R., Sequential machines ambiguity and dynamic
programming,
J.
Assoc. Comp. Machines, Vol.
7,
No.
1,
1960.
129. BELLMAN, R., Adaptive control processes.
A
guided tour.
Princeton,
New
Jersey, 1961.
130. BELLMAN, R., HOLLAND,
J.,
and KALABA, R., On an ap-
plication
of
dynamic programming to the synthesis
of
logical
systems,
J.
Assoc. Comp. Machines, Vol. 6, No. 4, 1959.
131. BIANCHII, R., and FREIMAN, C., Oninternal variable assign-
ment for sequential switching circuits, IRE Trans., Vol. EC-10,
No.
1,
March, 1961.
41
8
B
I
B
LI
OG
RAP
HY
132. BUCHI,
J.
R., Weak second-order arithmetic and finite auto-
mata, Zeitschrift
fur
Mathematische LogikundGrundlagen der
Math., Vol. 6,
No.
1,
1960.
133. BUCHI,
J.
R., ELGOT, C. C., and WRIGHT,
J.
B., The non-
existence of certain algorithms of finite automata theory (Ab-
stracts). Notices Amer. Math. SOC., Vol. 5, 1958.
134. BURKS,
A.
W.,
and WANG, H., The logic of automata, parts
1-11,
J.
Assoc. Comp. Machines, Vol. 4, 1957.
135. BURKS,
A.
W.,
The logic
of
fixed and growing automata, Intern.
Symp. on the Theory of Switching, Vol. 29, part 1, 1959.
136. CADDEN,
W.
J.,
Equivalent sequential circuits, IRE Trans.,
137. CHURCH,
A.,
Application of recursive arithmetic
in
the theory
of
computers and automata, Lecture Notes, Summer Confer-
ence, University of Michigan, June, 1958.
138. CHU,
J.
T,, Some methods
for
simplifying switching circuits
using don’t care conditions,
J.
Assoc. Comp. Machines, Vol.
8,
No.
4, 1961.
139. CULBERTSON,
J.
T., Robots and automata; a short history.
Parts 1-11. Computers and Automation, Vol. 6,
No.
3-4, 1957.
140. CULBERTSON,
J.
T., Mathematics and logic for digital de-
vices, Princeton Univ. Press, Princeton,
N.
J.,
1958.
141. CULIK,
K.,
Some notes on finite-state languages and events
represented by finite automata using labelled graphs, Casopis
pro
p6st. Mot., Vol. 86, No.
1,
1961.
142. DAVIS,
M.
D., Computability and Unsolvability,
N.
Y.,
1957.
143. ELGOT, C. C., Decisionproblems offinite automatadesign and
related arithmetics, Trans. Amer. Math. SOC., Vol. 98,
No.
4,
1961.
144. ELGOT, C. C., Lectures on switching and automata theory.
The University
of
Michigan Research Institute, Technical Re-
port, January, 1959.
145. ELGOT, C.
C.,
and RUTLEDGE,
J.
D.,
Operations on finite
automata. Symposium on Switching Circuit Theory and Logical
Design, AIEE, Detroit, Michigan, October, 1961.
146. ELSPAS, B., The theory of autonomous linear sequential net-
works, IRE Trans., Vol. CT-6,
No.
1, 1959.
147. FITCH, F. B., Representation of sequential circuit in combina-
tory logic, Philosophy, Vol. 25,
No.
4,
October, 1958.
148. GEORGE,
F.
H., Behaviour network systems
for
finite auto-
mata. Methodos, Vol. 9, No. 35-37, 1957.
149. GILL,
A.,
Introduction to the Theory
of
Finite-State Machines,
McGraw-Hill Book Co.,
N.
Y.,
1Y62.
Vol.
CT-6,
NO.
1, 1959.
BIBLIOGRAPHY
419
150. GILL, A., Comparison of finite-state models, IRE Trans., Vol.
CT-7, No. 2, June, 1960.
151.
GILL,
A,,
State-indentification experiments in finite automata,
Information and Control, Vol. 4, No. 23, Sept., 1961.
152. GILL,
A,,
Cascaded finite
state
machines, IRE Trans.,
Vol.
EC-10, No.
3,
Sept., 1961.
153. GINSBURG,
S.,
Compatibility of states of input independent
machines,
J.
Assoc. Comp. Machines, Vol. 8, No. 3, July, 1961.
154. GINSBURG,
S.,
On the reduction of superfluous states in
a
sequential machine,
J.
Assoc. Comp. Machines, Vol. 6, April,
1959.
155. GINSBURG,
S.,
Connective properties preserved in minimal
state machines,
J.
Assoc. Comp. Machines, Vol. 7,
No.
4,
1960.
156. GINSBURG,
S.,
A
technique for the reduction of
a
given ma-
chine to
a
minimal state machine, IRE Trans., EC-8, No. 3,
1959.
157. GINSBURG,
S.,
Sets
of
tapes accepted by different types of
au-
tomata,
J.
Assoc. Comp. Machines, Vol. 8, No.
1,
January,
1961.
158. GINSBURG,
S.,
Some remarks on abstract machines, Trans.
Amer. Math. SOC., Vol. 96, No.
3,
1960.
159. HAKIMI,
S.
L., On realizability of
a
set of trees, IRE Trans.,
Vol. CT-8, No.
1,
March, 1961.
160. HARING,
D.
R., The sequential transmission expression for
flow-graphs, MIT Electronics Systems Laboratory Technical
Memorandum,
No.
7848-T-14-3, November, 1960.
161. HARRIS, B., An algorithm for determining minimal represen-
tation of alogicfunction,IRE Trans., EC-6, No. 2, 1957.
162. HIBBARD, T.
N.,
Least upper boundonminimal terminal state
experiments for
two
classes of sequential machines,
J.
Assoc.
Comp. Machines, Vol. 8, No. 4, October, 1961.
163. HIGONNET, R.
A.,
and GREA, R.
A.,
Logical Design of Elec-
trical Circuits, McGraw-Hill
Book
Co.,
N.
Y.,
1958.
164. HILTON,
A.
M.,
Logic and switching circuits, Electric Manu-
facturing, April, 1960.
165.
HOFFMAN,
A.
J.,
and SINGLETON, R.
P.,
On Moore graphs
with diameter 2
&
3, IBM Journ.
of
Research and Develop.,
Vol.
4,
No. 5, 1960.
166. HOHN,
F.
E.,
Some mathematical aspects of switching, Amer.
Mathem. Monthly, Vol. 62, 1955.
167. HOHN, F. E., Applied Boolean Algebra. An Elementary Intro-
duction, McMillan Publ.,
N.
Y.,
1960.
168. HOLBROOK,
E.
L. Pneumaticlogic. 1-11. Control Engineering,
Vol. 8,
NO.
7-8, 1961.