SCIENTIFIC ABSTRACT GLUSHKOV, V. - GLUSHKOV, V.

• Document Type: CREST
• Collection: Scientific Abstracts
• Document Number (FOIA) /ESDN (CREST): CIA-RDP86-00513R000515420019-4
• Release Decision: RIF
• Original Classification: S
• Document Page Count: 100
• Document Creation Date: November 2, 2016
• Document Release Date: September 24, 2001
• Sequence Number: 19
• Publication Date: December 31, 1967
• Content Type: SCIENTIFIC ABSTRACT

~ r: ~ I I 1, 1
S102-~ /60, 000 0~4 , M5, 0-;0
Two universal criteria of D232,,D50~
here since they depend nct only on the quaii--y o-f -7he :-,0inpuTer ~ut
also on the experience accumulated, The price of ctie -,,ppra-on 13
then
q = ZLT1 (4)
T,n e
which is called the price of effec!tive speed. .9 note.-
Not defined]. The second universal criter4.on is" -.Ileti Tria-, of mini-
mum price of effective speed. Calculations Trnad~! r,,~ Kap--,-.on0-
va, according to the methods described are said ",o 5hcj,,,) ha-. the
computer "Kyyiv" designed at the computing center Of AS UkrSSR has
a price of effective speed about 25 times-less than -)-f ~he
-cm-p-
serial coinputer "Ural 1", in the case of suf-;,-:---: -X~
problems; further the price of speed depends -~n 7he hype of p-Ob-
lems, apart from the quality of thq,-~ompu-~er,
ASSOCIATION: Obchyslyuval~nyy tsentr AN URSR C-_7-n-e-z AS
UkrSSR)
PRESENTED: by Corresponding Member AS UkrS~,-R.
SUBMITTEDt.,. December 12, 1959
Card 5/5

ii-9
V i: i:i P 1. 1 '1 ~Ko v y, L
rl j i
A
C, f v
fn
y
D, J,.
e d r~ n --uperco"dUC L i ty ;ire :1 e ~3r lb
en los,_ 0 C, /Q Lill-
-1 'lie
are briefI-,,
Ims
LL"id t ! ic, I BH' free -,i-e
e
e r !:1;'Pear ini~e of ferrite ~~Oj~e q'j, 3:jf_-,,
r
J r 1, 1j(DO 0 Ci A 1
p ~r v e ed
e - in Aj t i t~_-:)Q ~,l r e )e i,'- billows

12 '(W
5/021/60/000/005/001/015
0210/0304
AUTHOR: Bluahkovi Corresponding Member, AS UkrSSR
TITLE: On the optimal dimensions of operative me-mory units
of electronic computers
PERIODICAL: Akademiya nauk ukrayins'koyi RSR Dopayidi, no. 5, 1960,
571-374
TEXT: The question of the optimai dimensions of the operative memory
unit (OMU) may be divided into two part8: that of the number of divi-
sions in the cells of the OSIU, and that of the number of cells. It i_9
assumed that the maximum number of diYisions in the finaX result is known.
It is necessary to know the number of additional divimions required so
that the round-off error disappears. The author observes that in the
case of computors it is impossible in practice to fiolve thin problem by
means of G.M. Krylov's rule. ['Ab.tractors Note. Rule not statedi
Assuming that the round-off error is independezil of the size of the
quantities involved, and that the round-off error of the suin of a number
Card-1/4

270117
S/021/60/000/003/001/015
On the optimal dimensions ofe.e D210/0304
of operations is equal to the sum of the errors of the individual opera-
tions, then the total root mean square daviation of the round-off is
given by
n
x~ x,)2 dx, dx,.,. dx,
12
2
where x is the round-off error of the ith operation, and n is the range.
Hence, for the 0.954 probability level, the total-round-ofr error will
not exceed twice the root mean square deviation. it i,,;i supposed that the
computor performs numerical operations to base q, and that m additional
divisions are required to deal with the round-off. rhen at the 0.954
probability leyelg n 3 q 2m (5) . The optimal number of cells is
to be chosen to ensure the maximum quick effective response of the com-
puter. A possible method of calculation is proposed which is baeed,
however, on methods which introduce an unavoidably large quantity of
Card 2/4

": 7 r,',, 7
.S, 0;! 1, 0
On the Opt-MA' D210/0304
unknown fafl-yt-- the-w t- ed on I 'v approximately. Th-
considers `,iie of arl 0%11 ri,tr -,-, If x is 'he uumbnr of'
of the 0MV, th-~ tim. !-,, .1i lur Lliv traiisit,.on of the prccetz,; f!olk
one ci.-J1.1 t:) 7 - ,.I' (I% -e , ~ .1 b
v( "he 4 .46;
ale Some ilil., t, Is I, I:Z~,q thv time usc!d for tNe triln~lt!k-
the proccs~ ctiv, (ji lhIs I liv. di~jfellfl!i not wl~ v or 1;1.
j z 4-- o f t b t~ w -.,i i ,1) 1,1 .1 :w -v 01 1, ! rt. v SLIM. n
contro I c i r isio% fit, d b,- :ncrew-iing the Power ot, t4i:
imPulse formai f,,i i )wri -j possiblo Io make wsi- of 't-
criteria of' ui,.'tTwit -s the funttiun g-,angth- -nm;_
numbet o f oper i: ! )n,i w)), , -r vi~.h an OW or Y. celliq .aa -)-i ~ it,
v.ithout app(,oi t4~ on vx, it i! -itot I- ~ , ( UW ~, Vie ENU is ch;)rAI:--
: ed by two :.I; !lml- v and till.' t-me or
,z
ng a code Thpit ill t i f I
i,: :ig operat , on n I liv a!- i~,v, 'i
's *hc ct,jn ,fl f '. .:
scctiol, of "to tic- 'Wd! ~.3~ llunabol, ill Aw ir-l vtl~ I.If:il
Card 3..'4

27047
0 2 6 0 0410 1 "* '1 0 (1 i G'
On the (jpt ;rii- I I nwn.,;: jr,.4 D210 0,19!
then thL nuril ii-j.. i ime o f a. rv i n tm ht~ cip, v-v - ,:i :n!; t r7i c I i ~'i
is given b.v mi (I t h-~
p
e f fec, t i A, e mi,ji) t i rill (0 og mil i) tmrl .~ i)pvi ;it t on
c not
U f I nd i rig i I w-i wit.-i 1 1 Jrdl- ll~. addl t 1 ~;Ilal
the charactev ol 0.- imf~-m it :r) -)cch~trg. hetmein he WOLT and 0ie EMU
mav be ebtainot~- ill ill-
p
GiVen that b 1 11,1' N ~IMJW t 1)
5
4%X4 1 7 d 5 -1 z ab I e Allot I s(-V f f*.,- t
ASSOCIATION Obc h.A, svu i a ri~ c n 1 11% 1 11 -;1? 1 C(myll' t i A', C
SUBMITTED De. f-mhv- 16 1 959
Card 4 '.1

S102 60/000/009/001/009
D210YD30"
AUTHOR: Hll,ishkov, V.M., Corresponding ~'ember AS UkrSSR
TITLE: On a method of analyzing abstract automatic devices
P_`RIODIC.'.L: Kkarlemiya nauk Ulkrayinolkoyi PSR. Dopovidi, no. 9,
1960, 1151 - 1154
TEXT: The aim of the paper is to 'Lind the I!,orithm. for construct-
ing a regular event represented in automatic device A by initial
state a and the set M of final state. An abstract automatic device
is any ;bject which can be in a finite number of states alp a 2p ...
an and has an entry with states x I , x21 "'' xm' The device is com-
pletely defined by a rectangular matrix
-1 !, (72 ----- a~*
Xi a!,') ...
X1
Card 1/4 X, a

S/021/60/000/009/001/CO9
On a me thod of analyzinU, D210/D30-3
where J j ) mt,,; ns a state into which the ~Ievice 1)a,--,;:;,)s from a st-ate
I
ai under the diction of entry x Any finite set of ordered entry
XjlVX j2p ..., x jk will be called a word. The set of all- words c:,
which tranofer the automatic device from the initial state al IIII
any of states of the set 11 will be called an event. The algebra
events is constructed by introducing three operations. Di-9junction
(s, VS 2), multiplication S 1 6 S2' Iteration iS,~. The elementary
event consists of a one-letter word x and an empty word e. To biii]J
the alogrithm the author usea the reC,~,!,, r expressions introduced
and defined by J.1,1. Copy, C. Elgot and J.13. Itright (lie'. 4: Journ.
Ass. Corip. Mach., 5, 2, 181, 1958). A path in A i.,3 mny sequence of
ietters x i and states v j0, i1, ajl, 'iV aj,21 ..., a~k-l' -~.Jk
aik such that any state ajp by entry x ip passes into a jp+1 . The
path is Eimple if all a j are distinct. The path is closed if ajo
Card 2/4

:,1. .1~ 66
SI/.021160/ 000/009/0011/00')
On a method of analyzing D210/D3O)
a . The path of ran,-e p is a simple closed path start_~: and
finishes with a, and does not fuifiil the states a a
.p
_xpres2-(_,n,
al P IL ~ The complex of range p will be called the :!enefLl e - I
obtained by omitting in each p-range p%th the symbois a, oiii~ ec
ing all other symbols with a sign of disjunction ;-rd tclkinff I- in
integrating brackets- The proposed CLlgorithm is a,,~-, fo!__oW19.
_;ng with a complex of zero range and substituting tile St'~,~es a,
via.th the complexes of higher range until -the Term R is obtained,
witho-ut L~ny of the symbols a - a , a The law -_.S
If the p~ ~11 2' 11
defined as follows; a alf x t),-.1on-s to a
'k J
complex of p range, (*p ~ U),, then letter is substItuzed by a
complex of p - range,, letter a by a compley of L),.,I, ranue and
-L j2
Card 3/4

On a method of analyzing
3/021/ 60/000/009/00 L I
D210//D3C)
s.) -)n~ The expression R will be regular and will repregen- T,"h:
event S defined in automat A by the initial s-tate a, ~ --I :set M -,,;f
-L
f2nai siates There are i figure and 4 referenci~s, ~ 'Sovier-blo,-_
and 1 non -Soviet -bloc- The reference to the 1!1111~tisl*i- 1'!tl' I'll")1 1 -
,:ation reads as follows; J~ M_, Copy, C .j.'1 C, ~'j t t, ar, (ITD.
Journ. Ass. Comp., Mach, 5, 2~ 181, 11j)8-
ASSOCI-%TION: Obchys:lyuvalnyy centr AIN UkrHSR (Compu~.-er Cen-cer
I.S Ukr SSR)
SUB I.' ITT 11"D No'.-e-ber 9. 1960
Card

S/04 1/(-C-/(:, 12/002/0021/301
AUTHOR; Glushkov, V..M,
TITI,r-. On an All.-,orithm of Syr~fhesis of Abstract kutcnat~
PIMIODICAL-, Ukrainskiy matematichi2skiy zhurnal , 1()W, Vol , 12, No
pp, 147-156
TEXTI The author considers abstract (finite) autam;~tki in the sense of
F.P.11-foore (Ref. 3) and Yu T,Yledvedev (Ref- 4). He propo~vpa an al,~orithm
for the synthesis of these automats according to the eVt!11t13 (in the Rense
of (Ref,~ i)) represented by them. The starting point of the representation
of events is the somewhat varied notion of the reg-ular expression of
Wright (Ref i 20 , This notion, however , 13 SYE~te.M8tlCilll.'T Ulgebratcized on
the contrary to (Ref, 2), whereby particularly the clooe -.:)nnE!(,tion of the
problem considered with the representation of gemigroups by permutations
is emphasized. The method is used for the synthesis of an autorn-at which
represents several Pvents,, The author gives 10 longer rules and ~ theorems.
Ile mentions B.A.Trakhtenbrot
There are 6 referenoes, 2 Soviet and 4 American,
SUBMITTED: November 27, 1959
Card 1/1

S/1 0,3/60/021106
B01 21/B054
AUTHORS. Glushko,r, V. Y. , Dashevski~,5 L, N, , '1i1r:Jir,_ A. I.,
TITLE. Utilization of Eleotron Computers for t1in Au-~-,)mafionV'~i
the Bessemer Process
PERIODICAL: Avtomatika i telemekhanika~ V)60, Vol,, 21 No,, 6'.
pp. 877 -. 88]1
TEXT; The authors describe the automation of +he (:.on-,rn1 fInd TegUlaT,110n
of the Bessemer process achieved after long experimental in,.ri~stigarion!i
which were carried out by tha Dneprodserzhinskiy vi!cherniv
8kiy Lnetitut (Dneprodzerzhinsk Evening Inatitute of Me-,allu~i-xy) an--
the zavod im~ Dzerzhinskogo (71orks imeni Dzerzhinski.v), T,i;! I-atter
establishments investigated the availablo nonautomatic. 0ontrolling,
ods of the Bessemer process, and workod out new ipothod;3 f3ii-it!iblo fel
automation on the basis of high-speed elpctron com.puti'rs, A n:iat,~tm )~~l
to be worked out by which it ia poasible to int,,~rrupt. tht~
7,--iL jtriel at a oarbon content of 0.48 0 a,-" [-I ~h' ~fl t' iC
burn-ir- i-ite of ca-rhnri of 0,007 0. 0013;) per fi)e :_~ :it,
Card 1i-

U L i I i I. ation o I' E.1 ec tro I I ('ompl I to ra !'('I' th'~ 0/1 o
Automation of the Bessemer Pi-ocess 2'-1 13 iij
converter tippinj.- must be predicted with an accu.raoy C. C i,-
The authors deecribo the methods of determining thiij ir..jturl- i1.9(2',
the,baLlis of theoretical and practical investigationci, This I n s tar-,
predicted on the basis of information received with the us-? of
of mathematical statistics, The information received "or -all me-,,hods
the determination of the instant is taken int(~~ account, 'Yorl: for
automation of the Bessemer process was performed ill t1'c' bti;,JN13; Fil--t;
the information apparatus was designcd, mounted.. and t-akan :Ln,:o cp,--ra-
tion at the Works imeni Dzerzhinskiy; it was automatica.11y or-nnected
with the transmitters, and automatically started and t,+Dpp~d; in the
second stage, a digital control machine was developed, This recording
digital apparatus was worked oL~t by the Vychislile"~nyy tsant:r AN USSF
(ComDutation Center of the AS UkTSSR'), It i9 describe(', -ind ztLi moc.,:
of operation is explained. The authors describe tht~ op,~ration co7,dki
tions of this plant, and its construction and priT%c~pal
was installed at 'the Works imeni Dz~~rzhinskiy in March 1960, At
rhe dE.ta obtained. from this plant are being
toget,nor oii th t-ho data --)f cheroiral arai.y9es, an~i a [")I
trolline rnarh3n,~ is set up Therp are 2 f,,giirea
Card 2/2

KAIUMUN, Lev Axkadlyovich, doktor fizilc(:~..mteintiti(,,Ie!3]cilcb nai0i; GL-USUOV ~
VY., otv, red.; POKHODZILO, F.V., red.; 14APfUCHI.TF, A.A,, tekhn.
110d.
[WI-kit is mathematical lo~icj Chto takoe matemaUchankala lorlika;
Kiev, 1961. 39 p. (Obphchestvo po rasprostraiienilu poUtic-eskikh
i nauchrvkh zr-anii Uk-rainskoi S&I., Ser.6, no.3.2) MTRA I_".11)
(LoEic, 6~mboiic 'aA tnpthomLtticnl~

RABINOVICH, Zinoviy Llvovichs kand.tekhr-r-suk; BI.IGOTESHCHEI'aly,
Yuriy Vladimirovich, kand.fiz.-uot.ra&.; CHERNYA1, ROstislav
Yakovlevich, kand.takhn.nauk; GADYSH. Anna Loonidma, Inzh.;
PARKHOWAO, Ivan Timofeyevic~, iazh.; OKULOTA, Ivatta P(?trovna,
inzh.; MAYBOROD.A. Lidiya Alel-sandrovna, inzh.-, LOMA, Stanislav
Sergeyevich; GLUSHKOT, T.M., 0tv.xei.; KISIII.A, 1J., red.izd-va;
LISOVETS, A.M., fekhh.red.
[Specialized SESM electronic cc.rnputorl Spetsiali.zircvannnin
elektronnsia schetnaia migohirm Kiev, Izd--vo Akad.zmuk
USSR, 1961. 144 p. (Mijul 1111:L)
1. Chlon-korroupondent AN USSR (fcT Glushkov).
(Eloctronic CnIoulating michin9G)

PUKHO11, Georgiy Yevgenlyevich; GUSHKOV, V.M., akaderik, o,t.v.red.;
.1 1
LABINOVA, II.M., red.izd-va; DART-1116' Yu.N., teklin. red.
[Calculus of complexes and its application] Komplejcsnoe
slenie i er.-,o primenen-Je. Kiev, Izd-vo Akad.nauIk UQSH, 1961. 229 p.
(MIDIA 12,:12)
1~ Akridemi-ya nauk USSRL (for Glushkov).
(Cor.~.! ~'XE)S) (Calculus, Operaional)

Uhr :';_,y

88997
?1 7/ o0
B01 9/B067
AUTHORS: Glushkov-, V. M. , Corresponding Member of th,.:~ AS UkrSSR,
b o-c ~ o r - *o- f_t~iysics and Mathematics, Derkach, V. P., Engineer
TITLE; Tube With Successive Beam Splitting
PERIODICAL: Priboroutroyeniye, 1961, No. 1, pp. I - 3
TEXT: A new electron-beam memory with successive splitting of the beam
w4s developed at the Vychrslitellnyy tsentr All USSR (Computation Center
of the AS UkrSSR). In this tube, the calhode emits a broad electron beam
hitting four splitter plates. These plateo constitute a fine grid
producid,. from a dielectric. Metal layers are applied tc) the innar side
of the fine slits (Fig- 1 ) - 505/~ of these metal layers are electrically
connected with an upper or a lower terminal. The first plate consists of
one part and screene off half of the broad electron beat:. The second
plate consists of two parts, each of which screens off a quarter of the
electron beam. The third plate consists of four Parts, and the fourth
plate consists of eight parts, each of them screening cf-f one-sixteenth
Card 1/4

, , t '.
68997
Tube With Successive Beam Splitting 3/11 61/000/001/001/013
BOI 9YBo67
of the electron beam (Fig. 2). If 11 plates are available, it is possilble~j
by a proper choice of potentials in the two halves of Ue platen, to obb
(2214) memory cells by splitting the electron beam into two'beams perpen-
dicular to each other.-Thit.-splitter-plate system cause!] the :formation of
a relief in the electron beam. The conditions for obtaining a relief and
the adjustment of the relief after each computation process are studied.
2
Current density must be 20 microamperes per min . For a tube or 61l*64
memory cells with an area of I mm2' the cathode area mu.-It bt~ 12.8-12.8 cai
ne- thod
to supply a current of about 165 milliamperes. To verify this I
experimentally, a tube was designed which allows the sij~rjal to be directly
observed on a screen. The tube contained a cylindrical cathode with a
diameter of 30 min, a system of splitter plates, a grid' zollector, and a
target. The splitter plates consisted of 100~i thick high-quality mica.
Their dimensions were 40*40 mm. in the center of the plate, two 1 x 20 mir.,
slits were punched out at a distance of 2 mm from onQ an:)ther and coated
with conductors. Although experimental results vi~,ve satisfactory, a number
of mathematical and physical problems are still unsettled. The different
Card 2/4

88997
succes-'e Beam S~11--'tt;~-
Tube
S/1
-.:0(,-
on
locatJon of the 'pict-es produ
-s; -~he effe-,, cf the S-Olitter
atinC -P,*nll of the electro..
1, c s
rlal es -ast be etc . There ar
Plic.
Card 3/4

8 899',7
3/1 /acvol/col /0o, 1 /101
H C. 2. rl 1.1 MI
0
2)
LeCencl, to Fi~;- 1: 1)
0 C
:"2 C n d" to F-
C -- d ,,~ / -11
Z

01)

fit
Fo

la,j it

ro; I

. ''1 1) 1
, .. 0(,,-' !)'l i~ !
1 -1 - 1, :! ~ , , ! ., , I , , : :, ~ ,~ L)

GLUSHE~V, V.!! (hiyev)
sorrip pr-!!.iqrn.,3 Df tY~, synti-e3is of divit;~l !orrjiut,:-rs, Zb;r, ricK.
mat-. 41 mat. I MRA 14-')
I"z. 1*6-3:37(1-411 'My-je 161. e 11
(Electronic dic-ital conputer-O

29;1) 29
113 2-) S104216 1/01 1/0j~
/6, ~000 (/ 0 , /, C- /C",;~i
AUTHOR~ Glushkov V 14,
TITLE Abstract theory of automata
PERIODi"U.- Uspkia matematicr~,~skikh nauk v n0 5
62
TEXT: The present paper is a detailed repre~;entatlon. of the
summary given by the author in September 1960 at the JJI Union
Collo,~uy in Sverdlovsk on the subject of general algebra The author
nearly entirely ignores the inner structure and the am,")uzits of appli.-
cations and describes an abstract tLlgebraic theory of t,ie a~litomata
wh.ch are -.haracterised by the number of the states and by the rules
of transition from one state into the other Out of concoption
it follows that many well.-known results had to bL and
comDleted before being enrolled in the developed tnearf, Besides of
those actually well -known results ~'Ine paper contains a number -if new
results of the author himjelf and of otners (e, ~; V G, Bodnarciluk,
A A Letichevskiy) These new results were attained at. the Ki.yev-
seminary of LLe author on the aLstra(;t tiieory o." au~ot-i'a,
Card 1/ 7

3/04 0c)
Lbstract theory of automata CI11/C444
�1 homo:zorphism and e,~uivalt~nce o~ automata Tiia i!-- '-Oas~3d
on a definitiln of ti~,e automiaton by G H Mealy ~iie~ A t.,ot,,10d
for s~ntae3iz7rq~ 3eq-uential circaits, Bell Systerr. :1 E! C 11 J o LI rn , Z~
(195'2). 10~15 - !0'[9) Ti,,e ti,,rce ~nteriziC, sets 0 f LL e 3 tIL t e 0
of the inputs, of the outputs) yet may be arbitrary and
not necessarily finite as in ref 1) I-esides the di-Ffilrence between
initia' and non initial automata is at. once stated: :hi? autc::ii.ton A
A( is at, initial auto.:~atori, if' Jr a Cixl?~! ele-
ment a,jinitial state of A) is Eiven (a,x) and -(a,x) are
the fuzicLions o~' the transitiorio( ;iiaj pinr of and- of
the ouLputa( Of rv -/ -.P. Into'I'd )) Adjoining soza~ dilferen~
kinds of homornori:hisms are considered e E! s o a I I P- d
-k.) is defined in D
by n e foli'-,wing three
and
4~f'-~ 'V6I, lor arbitrary a c -C L and x sa,-sfy ,~ie ---ol-
lf)Niiig condi lions-. x (a)
Card 2/7
1( 11 fa)' '~2

1/00 5
Abstract theory of automata C! 1 iX,14,!
but. t:.e ~J~~ i omo m o r p h i j m o f A a B Y
--s only det'ined by a mappirij.- Y: 2'.
~a,x Y'( a) x A (a x a) In ;-t way
.91 ~;)
1-3 t in~,u, ~-,hk2s nd ba u t om a t a Tnen tii,, on-
CF,'p' ion of e iu i val enc c is introduced and i t Is proved:
Theorem In the set YA of all baing P~,uival ent to each
other ti- ''Ire exists one and except of GIL only one au-
tomaton, on to which every auzomaton of can be i-'o -~ Qm 0 r ~ h -1 -
ca2ly ;-,iapp,-d state of this auLomaton is !,on cquivalent to tkie
others and tne uower of its state set is not larger tl)--n th'-~- pc,,-.-e.r
of tl,~P state ~--2t of any arbitrary automatrn ofjl~ , The procf c,` i s
-1heorem, consists of the description of a me-,hod for of an
irbitrary Lea-ly automaton ( this one is cailed reduced, if two ar.
states are not equivalent). At last the :31-ecial -ase cf the
auto,-nata of Mcore :s considered (In this case 'C"),
where,,(a) --.s a unique mappinr, of ~~L intoVH
In tneorem 4 i~ --s onown that for -very A trvre 2-3
C ~,. r d

:1 ., - 2'~
3104 216, /0 - ~/j J 9/_)O I/w
Abstract theory of automata
an e~iu i va I en t ve - :iu to ii-,a to n P -,-hero in. ca~ii~ of A fini-tq b
zii 6-ri t as we 11 te. (,!Losen f Ini te , -;ht, re Lilt- N LIML-- 1- 0 f' 1 t S 1 L ',,' Q c II -i
M - I)n. m bein- t1lie number of tne in-,.uts and n -it? n-.i E 17
,D the stat---s in A
~2
: s dedicated to the representation Of the in a u 3 Ui,:,- t a
V- f ( 1". % V, - I
.. -) I ~ ~l /11 -) olle indicates free sexagroun 9 w i t h i d e i-.. t L ty wii ch
are consi-derecL as 3--ts of words in "he 7 1
;S r,.)- n 'he au~oii~atori A, if
being induced by a state of A(as a mapping ,I:a ,L,~in~~ induced `-y the
s rate a ~-- ~:ll of A. a mapcirig of tne iriput semi Cro,-~-p into the jutput
s~mir-,roup is '.vhicri orders tc an ~irbirrarj- inz,ut ,-iord. the
"ion
out:,"ut (a A.,;~ong othi.-.-rs It is n: i ne cc- s -
sary and suffi~,,Jpnt in order a of F(~~ j z i F to be re
presentable in A, tiiat 1 ) e ve ry W, rd p o f F i wii il rh 1L iii kiL
aed. h~ I
is -Iiie samie length as ~iie map~int,, f(P)-
22 ) for ev-~ry arbitra:,-y z~
11 bi,~n~r a w') a 0

C! i I
Abstract tUeory of autom-ata
A mapp-,ng satiofyi.%~ is ca-led ~in
zapping;
Theorem lh~j cover of tne set :)f t,,,e states (ff an arbitrary t C: -
maton 1-n shica a -.-iven automatoi, ma;~ping -~ i_--, renres,2i.~:Lbli!; az: no t
omaller taarl trie set of ~,-,e jtlate:3 of t:.:.s At -asl' t h -~ ~,Gn-
ce[)taor o" event 1,- intro,,uc,?d and
Output ji~rnul~3 :s, con-;idk~~I-Q(j in L,'je
,vents in iin-,te automatu and tne o~-,ratioas _nvol;ti-
.-ated. ,,.,here 7.moic ot~i%-~rs a ~enera-lsalion of' t,,(-, ref 16
R F ~,.c:laul,nton uni H J:-imanda (R~-f ! R F and a 1"
da: ReZular expressions and state for autD:jjat..-,, 111LW
Slectr Comp , EC NI ( 1 )610) 18)) is deZcr.JL--d Bas~-d on a
- .. V,~* tS 'n
very :-eneral statement on the reuresentatior o f -'e rE~
finite initial automata, ti;ere ij prQved
Tilt~orem -~L!l t u arIL) i
Lrary re.~uluzr expressions to fz2,,d oat, re-
L~resented by t!-ese ex,,,re~isiuns ar~ identic ~,r
~4 is 6edicated to a detailed in-itaEution c0nrlexiCzi e t -M E! en
tile theory of seml~-,roups '111d '-Al t.[IPQI'y Of R,ltl-)M,11,H.
C,ard

)05
S / 0 4 o 1
Abstract theory of automata Cll'/C4,:,l
~'urther develo:-.r,,.t:.,it of tiie a:~,iouricement ne a u t !~,:) r
Abstraktuyye automiaty i ruLt~iypniye vo~joduyll p o 1 u,,, ru 1) A b ra c, t
al~ito.mata and *,he .~ecompositicn of f'ree D LN
Th e d e, c om 1. o ~; i t i o n K K A o4' f-, :e F ~.I ,he
alphalbet is called auto:.-,at(,)n decouma~;itlion, i t
eve ry r. e ~;ulbo e t i s -,,;i,o I i y i n-~ i, 1 n a -.11-,) e -
Theorem. 2q.- Tnere exists an on*,; to-one
defined in a natural- wa~-, L,e hP- S-2 t -~ f a I" I ~-' C 1 'd -r.:. ta:
-o1 tom at E., oe I rI6 n C t 1 somor:;h -,,I i " 11 reopec t to :3 t :It t~-q noll t 1 1,
71 -,.h an arbitrary .-,i-;en inout -,C ~~nd
,~ut siznals) U -1 - q
t',,,e set of all automata decoi.,i,,~csitionz3 ot' ne I .'PLI ~V ~fl
ide.,,Iit~- in the -1rhabet
t CO 1", r1 t%):1. ~~O Z' I )rl:; ti.."
d-r(~ct i ~zi:; 1, Amoi--
ven results of S, lluzillo IIR~f 50. On :-;ome se,,uentia-l ma
-?m Fac Sci K-,-usyu "; i~ i I'
1 and -, C A A 1,
~;ard 6/7

Abstract th..~,-)ry of auluumata Cl I/C~414
polnoty d1ya Konechnykh aotomal.ov I 'Condi tion3 for -,he :,O:z~,I._~tianess
of finite uutomata Vyctiisl m a t,~ rr, i matem , _1 ) )
The last ~~6 dLscusses tht; exj.Qrimeilt.~ -xitn.
several results (partlL~ of 3
on abstrart mach-,rics T ran s An-3r '."L a tLi .3 o c
400 - 444) aii--, well known older result;;
The aut.%or mentions, A Sh, Blokh Yu T e dv e d ev L A Skornya'-ov.
Yu. I Sorkin B A Trakhtenbrot,
T~ere are I fi~-ures 30v-;Ot i,.'Oc and
'I'he four most recent references to Engli3n lan,ua,-.:e read
as folio-as: J R Bi;chi 71eak arith,-_*_- --nd fin-,
tornata, Zeitschr- Math. Lo;~-~ic and Grundla~-,en der ILatil il.
66 ~ 92; S. GinsburE Some remarks jr. abstra~~t rriaciiinaz T r:---.l sAm a r
D"ath SOG, go i,-) (196,o) , 4,jo - ~4., R F Lic ar": a,-a a -
rianda Regular expressions and stare zrai~ri.~ fir IRE T r aan s
Electr Comp EC-9- NI (1963), 59 4 5- -, DS iIetiiarwzrdI
senuential machines 11HE Trans Electr Co;-p , E0 _t~ N
SUBMITTED: April 1961
Card 7/7

'PLUSHKOVI V.m*
Abstract automatons wd the oubdiviaiern of free Emmigroupo. Dokl.
AN SSSR 136 no.4.-765-767 F 161. (MIKA Vol)
1. Predstavleno akademilrom F.S. NovUovym.
(Grpupop Theory of) (Automlita)

.GLUSHKOV, V ktor Nikhaylovld), akadomik; YUSHCHEMO, Yeltatj.-~rlnA
L o V I n o v ria ndl I z ITO! ;2~, F, , I'll.'e" ~L% J, 'i , "L, A
flz.-nat, nauk, prof., retsenzent,; 0A., red.
izd-va, SflAFF.TA, S.?,',. , tekhn. red
["Kiev" eiectronic computer] Vychislit,el I naia masnina PKi,Fr.
r khlzd t USSR,
opisanle, Gostex a
15-1 P, (Electrcnic cj-rute-,.~)
c
(Programminp

PHASE i KOK s o v/6 35 9
Gluolikov, VJ.ktor Mikhaylovich
Sintez ts1frovykh avtorratov (The Synthesis of Programmed Digital
Computers) Moo,:.-ow, Fizmatgiz, 1962. 4-('6 p. (Series:
Matematicheskaya logika I osnovaniya vattmattki) 1.5,000 copies
prilited.
Ed.: B. V. Biry-ulcov; Tech. Ed,: K, F. Brudno.
PURPOSE: This book 13 intended for mathernaticiann arid engineers
working in the field of data processing.
COVERAGE: This monograph is part of the series "Matematicheskaya
logika i osnovaniya matematiki" (Matbematical Logic and the
FupdamentalB of Mathematics) since in the study of the problems
of the ra"I.-lional desIgning of programmed digital computerp- the
concepts and means of mathama logic are widely utilAzed. The
author considers t1va CollowIng, fIve major queations of s,)r-nthesis
Card

The Synthesis of Progrrainmed (Ccrit_
S 0, V
of programmed digital computer.": 1) yrith 1- dealln,-~
83
'o.,ith the perforil,ance of lrvilvlt~i~i,,O wilt:,, In i1ric circult; :2)
abstract !ti !Ietoiwining the meriory
capacity requli--ed
In wh1ch lo-j,~a--,. an--i me~,jo!-. ;Y)j .:I ~rj~,-Ijj
linlt; --'and the cowpi,iilo~, -i,i t and vih.lcli C8.17,0111cal
eqwition.rj I ci,dei- to 11he npoH.eir, of
Or, untt synth-~1-;.1's
discreLe elementi-, n,)- r-,-sesc, a coirl)inatior
,ythesl-"
5 reliability syn dt,, -,1 t"! ITI~)d I clci-, ~A On of tie
designed circuit,~, f(-.lr t:,`ie
the V
of their performance. -14- d thi t In a. r
(1.111;10171 tC the
binary number syst,--m anci tii-~ of -.he theory of
-,' - - --i naqjl. i i,e,,' o
probatility, no -.poci-,111 im,.,.' ~e!i.~ -i-1. I
the reader. Therl- F--r- at ",.t
3 French.. and j. Garm~ij-i.
which is zynth(~,jj.: ,1iejf3 lat-t,.~r CircuLt',;
Card 2/7

GLUSHKOV, V. M.
"Problems of ard 'r, 'Aie
tlie(,ry of' atitonvita"
at, ('(l" LIU coill, )f, Swl-d-l%,
1~5-22 4.(jg 62

It7
Yu K.
-tu'vo in
-~y
:ixcd rend DI* th'Ir 3olutioll"
c.' Ki(!v
robLeit2 of lermAng
Flutc.mat,~', LZI)
d 'i A. A. uo,! or ccriputers in
of in,~L~trjmj z~Lhoda of bulldln~~
ccnz true. ion" (Scanion 25)
V. A., Ccrnuter C~2.-.LCr, Acnaemj Of
-i, K
-S-ieices -rkrainip--j SSI ,Lev f1960 po.,itic.7 -
";,utcmalic recooiition of tyjx~wr-Ittzn let-era"
(Session 36)
Cr.,;mnn for Prclc,lsulnij,
rc-,~-t to bo rr~)f.lttrd for t
j,~, 14~1111 deat ri=any, ;,u,-, - 1. sap 19~,,

GLUS11KOV, V. 1.11
It Digital automata sy-sthesis problems"
report submitted for the Intl. Symposhmi on Beirly Syste,,,u; ru--d Finite kitomata Reory
(EFAC), Moscow, 214 Sep-2 Oct 1962

ACCESSION NR: AT4016401 S/3049/62/000/000/00,DS/0010
AUTHOR: Glushkov, V. M.; Kovalevskty, V. A.; Ry*bak, V. 1.
TITLE- An algorithm for teaching a machine to recognize the vimplest kind of geometric
figures
SOURCE: Printsipy* postroyeniya samoobuchayushchikhaya sisticin (PrixLeiples of con-
struction of self-instructing systems). Sbornik materialov simpoziums, 1.961. Kiev,
Gostekhizdat UkrSSR, 1962, 5-18
TOPIC TAGS: artiAcial intelligence, learning, self improving machine, cybernetics,
perception., character recognition, pattern recognition
ABSTRACT: In this work there Is a description of an algorithm for teacbing a universal
computer the recognition of the representation of several of the simiplest geometrical
configurations, re.-ardless of their size and position In the field of vision. The distin-
gulahing features of the figures are the directions of the contour lines. T'ne drawing is
characterized by a Bet of numbora, each of which In proportional to the nuinbor of points
of the contour In a given direction. In recognition, a caleWation Is made of the corrdla-
tion of these numbers with standard nets which describe certain "nveragpd" (normalized)
figures. The drawing refers to a particular class of figures deponAing on that statnda:rd
Card 1/2

ACCESSION NII: AT4016401
with which maximum correlation is achieved. Although this method of describing figures
does not permit correct recognition of all geometric configurations, Its advantage resides
in its invariability with respect to consecutive shifting of the figureti. The instruction can-
sists in the automatic determination of the standards which provide the most correct
recognition of the figures. The standards are calculated by averaging the silts of direc-
tions of all the drawings used in the instruction, During the Instruction phase, the class,
to which a given drawing relates, is indicated by the human agent. The authors point out
that, in line with the special terminoiogy adopted by certain Invesflp~ators, the algorithm
described In this paper might be imagined as a two-stage perceptron. The equipment
used in the experimental studies, which were made with the "Kiev" general-purpose com-
puter, is described. The results of these tests are discussed, 04-9. art. has:
6 figures.
ASSOCIATION: None
SUBMITTED: 00
SUB CODE: CP'
Card 2/2
DATE ACQ: 0GJanG4
NO REP SOV: 001
EDIM 00
MER: 003

ACCESSION NR: AT4016402 8/3049/62/000/000/0019/1W26
AUTHOR: Glushkov, V. M.; Grishchenko, N. M.; Stoply, A. A.
TITLE: Algorithm for the recognition of intelligent serntene'es
SOURCE: Printsipy* postroyeniya sarnoobuchayushchikhays, datem (Principles of
construction of self-instructing systems). Sbornik materialov simpoziuana, 1961. Kle,r,
Gostekhizdat UkrSSR, 1962, 19-26
TOPIC TAGS: artificial intelligence, syntax, data recognition, leunIng, self-improving
machine, learning algorithm, cybernetics
ABSTRACT: The problem of recognizing intelligent sentences of one particular type is
formulated in the article. Ile authorn consider a finite set of (Rumqlan laigWe) words
(substantives, verbs and prepositions), from whicia sentences can be conutructed accord-
ing to the scheme:
where cl Is the subject substantive; Is the predicate verb; n is Ike preposition; 02 Is
the object substantive. Let there eidst either a list of aU the WeIRgent isentences whioh
Card 1/3

ACCESSION NR: AT4016402
can be composed of the words of the prescribed set according to sclieme (1) or a certain
"object" capab;e of determining whether the sentence composed according to the scheme
does or does not make sense. The authors' task was to construct an algorithm which,
after processing a certain body of randomly selected Bentenceil and establishing the pair-
wise correlations between the words of the initial set, could, in the first. place, establish
with a certain probability the Intelligibility of formerly unencounbored flentences;
secondly, the algorithm was to reduce the possibility of incorrect answers as the number
of processed sentences increases by making use of an estimation of the outcome of its
work on each sentence and an estimation of the Y~ssibliity of emplo)rinj; the list of all the
intelligent sentences, and, thirdly, as the number of processed sentences increases.
reduce the mean time in processing one sentence In comparison with the nxean time
necessary to review the list of all intelligible sentences. In order to reaLize the last two
points, the principle of instruction with a "teacher" and the principle of self -instruction
were used when formulating the algorithm. 71o authors describe In detail the develop-
ment of the algorithm. Two stages are distinguished: 1) from the set of sentences which
can be formed according to scheme (1) by using all the words of the initial group, (the
number of which equals nm(nk + n + 1), where n, in and k are the number of initial sub-
stantives, verbs 4,nd prepositions, respectively), the smallest subset is selected which
contains all the pe,irmissible septences; 2) from the subset of all permissible eentencea
Card 2/3

ACCESSION NR: AT4016402
sentences the intelligent expressions are selected. Orig. art. haij: .1 formulas.
ASSOCIATION- Norm
SUBMITTED: 00 DATE ACQ: 06Jan64 E1,11CL: 00
SUB CODE: CP - NO REF SOV: 000 OME&- 000
card --1*. 3/3

ACCESSION NR: AT4016405 5/3049/62/000/000/006310072
AUTHOR: Glushkov, V. M.; Kovalevskiy, V. A.; Ry*bak, V. 1.
TITLE: Universal device for the investigation of Image-recognition algorithms
SOURCE: Printsipy* postroyeniya samoobuchayushchilthsya sistan (Principles of con-
struction of self-instructing systems). Sbornik materialov simpoziuma, 1961.
Kiev, Gostekhizdat UkrSSR, 1962, 63-72
'TOPIC TAGS: cybernetics, character recognition, optical character recognition,
~im3ge recognition, pattern recognition
ABSTRACT: The authors propose a universal device for the study of image-recocini-
tion algorithms, the purpose of which is to introduce information regarding a
graphic image (drawing, plan, etc.) into a computer. The device is controlled by
the computer, a fact which makes it possible to simulate any kind of scanning of
a drawing executed with India ink, printer's Ink or pencil on paper. in this case,
there is no need to transfer the drawing to the memory of the computer; i.e., to
burden the memory with unprocessed information, since it in possible to refer to
any point of the drawing at the necessary moment. The device is cap-able of dis-
iinguishing 16 gradations of grayness, thus making it possible to process not only
Clige rawings, but half-tone work as well. The Instrument Is designed to be used
r ~z -

ACCESSION NR: AT4016405
with the "Kiev" computer; this universal digital machine operates with a 41-bit
code, with a three-address command system and a mean speed of 10,000 mathematical
operations per second. The machine, and Its subunits, are described in detail In
the article. The author reports that a form of the proposod univvsal device has
been in operation since December of 1960, and has been successfully used for the
study of (1) the algorithm used in instructing a machine to recognize geometrical
figures, (2) the recognition of typewritten digits In the presence of printing
defects and (3) the reliability of the automatic reading of graphs. Orig. art*
..has: 3 figures.
ASSOCIATION: none
SUBMITTED: 00 DATE ACQ: 06Jan64 EMCL: 00
SUB CODE: CP NO REF SOV: 002 OTHER: 006
Card 2/2

- GLUSHKOV, V.M.; DERKAGH, V.P.
New principles for constructing the unilaternl merpory of
electronic comput,,~rn. Avtom.i prib. no.1:26-214 Js-flr
,62. (SERA 15:3)
1. Vychislitellnij tsenttAN USSR.
(Flectronic calculatir- machines)

'Ic
:-~/10:2/6 2/00u/ol.) 1/oo,-Voo
Hill ;Ilkov I.,.%:. (i,j(!V(.V)
A principle ot, ck univer,;LkI. re;l(lin-; altoiil"LiC dC-
V i c e
Avtoitl,ltykit,
'L - of ~k pjAt turn 1-(,(, u;, m t ioa mzic~'Line ui~-
'ill aut:loz- ~t Variant
I
si~,Jl ~vlliclh he Coil.L~idcrs LO he the sivlple:it. I'voul ":w view point,
-~impliffyjn,7 Ll,?ct),Iirl - ( . ument co-11-
o -)I see ~jlgori thin i. j;i.,; tr .
of ~,, I In i o i(,(- trolli c kli "7i t;x I cunputer vv!ii ch instva:l of four
llo-m,l I 'Ierl"I, i Cs lizi, ','(All L CN!; i Cill (I,-' I'l (-C-t iOll 1-ti- L
t h(: liuri zolu~d kie f I ~Ct i on I !;Lei, the spot Cil I-C'.,i ,;tur
,ind the brij-;ane.-js reij.,iter (!;;.') . 'flit! Vl*, Ill, alld Sa for hoth storiil~4
Of ill fona.~l Lion , tile !;:~ ~1110-,vz; only for re"(101g.
ill'e COII,lt?Ct,~d till-0Ll;-,lI a LII;IlISiiiittuiI to im indi Istrial- type N ar
tl-.e Coded sir.-II'lls from d"t and V,'Z deterlailic tIlL. doflectioll of tLe
Si~ si~,niil. acts un tile focus I - - -it
tube i)eala, tllu ing svstel~l tlc 01w di"
tilt- )L jvki Lhe vix\iillum (dodo
:v _to the 1,1111ilaula klilaelmiolls of -t,~jItAllIg 1;j)(
card, 1/3 ,

I/W~I/C~ 7
number corro.,-;ponfl I n- to -, It,, I oa:; L :'-,ell's iw~ ~~put
Zen) villue t1ke vinohll~~ IS flW thl,lexl:nlOil,; k11' the
11, av; i 11 1 v, Firs, imil ,:te Mid -10, kilil-
UI)S , adju.,itc(l , it I'L (-I, %,!ii ch the sc;um iIll, betim ia I It,:iwd wl th L ik- ct it ',cr
iine of t1le til-illvill!, j,.Ijkl 1p,
I -
Lhe individuai part-s Of Cite Lill,-,th 111d CUI-VcktUIT Or t1W lill(!,
chilracti:r I .%;', ic Poi ilt:-; utc ) . Prol.i tile Vesill, t..,; obl-ii i I Ie, I L :w L;eikvi'a I I /,Q~ I
of the reprodoceo drinvint- i:-; deterflilled (t:le inv,lri~ult) and as L;,L:
La,it ;t;t:,(! ol* t:1v woce.-is this invtarianL is Comp,iri,-ti t;ii,h tic pos;;ikiv
li;--iits of' it.,; chi,, ;it uhich L~w artal VZkAl It.:- .,IV(-'S Lile ;iUAC
~_;C'scrlhcs zlw o:, '1,OU
01' 1 j v c T'l'. t'lljlo of t I, C01% i,, '.I-
,;ary tal)le) of iven ~;Ct of IS -tOPOLI ill the 01' tile COMDLI~.C;-.
c'; I c I Isi s C, 1, t ~ 1,2 idgt, ri L hF,] o V :)a t t e I'll Puco."I'll I I, ioll ~;i V,?;i ~,hov e
L;'.;,t L,10 ~ I,LX 11:11;111 iWC til'i,C"' (I ~' I'12j)I_OdtXti Oll I S VV~Jkl I I'vIl %, hOll t:(, t, t-rial Ili it !.00
61upe of' a lint it a ivell poilit'. Ill the proposed I~Ieth-olj t:lu 11111ilt)('r of,
hill'try cligitN (lCtvil-Millillj, this in L'sic code doe:~ riot c-.:tev(1 5
where k - tile max. number of poiltive (It gjts ill tile cokie. It is
~ rd 1/3
I'a -

u ~-,A -,"ooo/u, I,/cu
.1 t I! jl(jo C 01- 1-t,k! i I Oil Q );.I i) 0 X C Oil L 01-1 L'!i W-1, lltl ~:~110 i'd Vi I 111~ S tilit'.
;1(),L for' ~ 1;-.t 0~** 111w6ers or let-,".'r-s ci~IL 7be accol.ildished ill much
f:It'l-0 Biro ",I lloll-~~ovict-ljloc :,IC 4 lau,-,L recent
pul-Lications v(-!ad iu,
;'o I'll Joi;-A, C-slidicQ1,
P1*0 I"Ui.ilil" reco..'I"LLioll, Proc.
procc.,;,iin, ldctui-LaL iLiformittioti %-,ith I di!1it;d co;;iputcrf
CU111%, 1957. (11, Op. 221-229; !,. ilaurnok,
P;~e USQ Of COI;lj)IJt01-S f0l' tiLlLofic.-LiCZ11 FeZldlllg, ALILomatioll PI'L)gCeSs,
2, lit). .1, pp. 158-163i Grim~,dalu, 1F.h. 511I.L'tur, C.-J. cUrvis and
i Lbul-11, fol' Lho I-CCogil it i Oll 0 f J,i,tt I Proc .
V. 106, 6, 110. -18, 1~j9, 111). 210-2,211.
6 A 7 )1
Card 3/3

9/21'1 /63AW003/009/0119
A015QA126
AUTHORS; Glushkov, V.M., Kovalevskiy, V.A., Mikhaylevich, V.S.
-------------------- --
TITLE: On the reliability of discrete automats. SujjmM-.t-3r
PERIODICAL: Referativnyy zhurnal, Avtomatika, telemekhu..ka J. vychislitel'naya
tekhniRa, no. 3, 1963, 48, abstract 3A278 (Tv. VI Wes. noveshcha-
niya po teorii veroyatriostey i matem. statiatlk(i, 190). Villnytts,
Gas. izd-vo polit. I nauclin. lit. LitSSR, 1962, 209 - 210)
TE,U: T.. article gives the conclusion -to the paper on the inl7luence of
malfunctions of separate components bit the functioning of diit.,arete wAtomate and
cites certain hypotheses as to the nature of malfunctions. '.Nle authors note the
value of J. von Neumann's work (Probabilistic loglc and the aynthesit; of rella-
ble organisms from unreliable components, in collection Avtowaty' Klolw(~W' U.,
1956, 68 - 139) which demonstrates the possibility of uyntheuizing roliable or-.
ganisms from unreliable (i.e., such as admit of malfunotions) aom)onents, as
well as the work of Claude Shannon and A.P. Moore (Reliable networks from unre-
liable relays, in Kibemeticheskiy abornik, v. 1, Moscow, il,,, 1915a, log - 148)
Card 1/2

S/27.1/63/000/003/009/09
On the reliability of discrete automats. Swmiary Ao6o/M26
which studies the reliability of discrete automato composed. (if rele-J.-contaot
elements. The method of investigaticig th,., nature of the ran(lom malfunctions
consists in the analysis of the solution of equations descrIbing the operation
of the automats while taking into account the stochastic pr:)oessea ooUurring In
the machine. One of the possible caLlses of malfunctions in altactronAlc comput-
ers may be the electric fluctuationn occurring in various conpDrients of the not-
work, and also the asynchronicity of' operottion of the separate units of the ma-
chine. Qualitative estimates are obl;ained for the probability of rialftmations
in actual devices. The investigatioas call"ried out conatitute iui important stagii
in the solution of the problem of iniestigating the d3mamic reliability of dia-
crete automats.
M. 14,
(Abstracter's note: Complete translation]
Card 2/2

"2 c -i~. 1, r

GLUSHKOV, ll,L,:. (Kiyev)
S,~11'-or~,anlzint, 3,yst;(jmt3 and the abstract thr-ory of' ntorwlta,
Zhur.vych.mat.i innt.f'iz. 2 no,3:4'1--4~,,-- ~~y--Jv- (MIRA 15.-.7)
(Auto,mnt,ic con'.rol) (Int'ormation
(Electronic cndculatft~:r machini!.,I)

I i 2 7
3/200/62J'002'/OJ6/006/007
B112/B186
I U." 0 V
Lielfins Lruc tion in the perceptron
IJ ~~i Ztiurnal vy ~;n i s 11 ti., 1Inoy matematiki i matematicheskoy
fl:Ziki , V. 2, no. t) I j )62, 1 102 -1110
TL X'~' discrete spi,,metrical' t-pe,-cejjLron is consid,;~red, chich is able
to a' L3 L z rq,ui sn t,.,.,o lforzs il and ~. The form P consists of n h0rizontal
!Ines, and tne formi of n verticai lines. Lach of thene 2n lines
.Orstltutes a singie mappir,6. For this perceptron the following theorem
is derived: 'or any positive number ~. triere is a number s such that !he
pe r-e'ptron 3 in the state of sei :'ins truc tion will conserve the initi4l
ciass ificu Lion of mappin6z -iitn a probauuity p -- I if the lower bound
of tiie absoiute values of the init'lai coriditions exceeds the number s, and
i f ai; 1 mappings have, trie same proba'~ i ty . Besides the perceptron B,
a ~jyirm-ietrical ~,!, -perceptron ' L5 ;;onsi,iered, -,he characteristic matrix
of which is a diagonal matrix. The pefceptron C is shown to have no
112

3/208/62/002/006/006/007
irl. t.~.e ,,:Vcc:Arc)n B I I 2/B1 66
for oulfin:;truction. This :.s I~Qnerally valid if the initial
ifical~ion of t~.e :;iaz.in--o -ofers all mi,ppings to a unique form.
z;Ludy '~,a6 made in or-.IZ~r '3 ;Dtlcl~y the ~Ictual limits of sc-If in-,3 true tion
perceptrons on, a S.'ric, uajis in reply to the analysis of
tne Dencivior of PercQjtrDrIs Made by W~5cnblatt in his papers. Two
Lne0ra!,-,z Of JLcttisti,-ai oepurability in the perceptron.. Symp. Mechaniz.
i zn~;Iand, Paper 1-3, 5-22. There are
'nuu,rnt Proc, Teddington,
2 f ieure5.
~3:. i T TED ",Lay
k;;,trd 212
0

GLUSHKOV, V.11,11. (IldusWcov, V.Pl.], akademik
New dere-lopnents in cybernetics. Avtomatyka 7 rLo,,3:85-J)O '62.
(III-Rh 15-.6)
1. Al; USSR.
(Cybornatics)
-

D2 34Y1)306
AUTHORS 11ushkov, V.M. nzir V.P.
TITLE: ,uicknesg of response of tubes with
consecutive boarr, bifurcations
Ukrayirislkyy fizychnyy zhurnal, v. 7,
no. 12, 1962, 1280 - 12b5
T EAT: The above tubes have been de5cribed by ;he
authors (Priborostroyeniye,_*-'no. 1, 1961; Avtomatika i pri.horos-
troyeniye, no. 5, 1960). It is found that the beam switchin(7, is
slowed down owinr to the capacity formed by a part of conducting
slots of the f;ratinj-,s. In the worst case the switchingr time in-
crease is proportional to the sum of two larGest adjacent renis -
tances, multiplied by the capacity due to 1 ,A of slots in each
electrode. Thia capacity is difficult to determine analytically;
a method based on 4-raphical representation of the field diStri-
bution in rf_-commenaed, and qxamples are ,.,,iveri. If therv are no
more thi,ti 1024 mei%ory elements in the gratine, millioi.s of awitch-
S/16 62/007/012,/004/02-1
Card 112

S/~, 85/62/007/0; 2/004/02 1
,,ulckness of reoponse of tUbCO . . . D254/D506
ings per secoria are possible. There are 5 fiKures.
AS60CIATIC1,; ir-stytut kibernetyky AN UR~R, Kyyi,r
(Institute of Cybernetics, A6 Ukr~,,SR,
r:iev)
SUBLITT~--D: lune 2, 1962
Card 212

GLUSIaOV, V, [Ulushkov, V.]
I
In tfie liFht of cybernotics. Na-Ld-,-i i zlhrttia 12 il().5.17-12
i
MY 162-. (%..1.2.,' 15.7)
f
1. Vitse-prezident Ali' VSSR.
(Cybernetics)

Gw6HKovf V.M., akademik
Calculating machines and automaidc control in iixbastry. Vest.
AN SSSR 32 no-4386-90 Ap 162. N-MbI 15-5)
1. All USSR.
(Electronic ca1uuhtth-g.,, nvichlno3) (Aul'.0MIL Lion)

NALIENSM', GLUSHKOV, V.M., ret-~erzont;
lzd-va; SOYCLrjV-'., T.F., red.
[Dii~ital control machirery and automation of production
processe3] Mfrolrye uf..,--i,.,liaiushchio i-noh~;ny I avtcina-
0~1:,A 17: 3)
1. Akaclemiya nauk. -,!u.Ji,-.ov).

AYZERMAN, M.A.; BRAVEFMAN, F.M.; GLU11KOV, V.M.; KOVAUVJ'XIY, V.A,;
LFTICHMKIY, A.A.
Theory of image recognition and self -feaching sy~items. Jzv.
AN SSSR. Tekh. kib. tio.5:98-101 S-0 '63. (WRA 16:12)

Ila r.

GLUSKOV, V,M,[Glrshkov, V,M,J; SZA.:-:Z, Ferenc, a materatil',iii tud-j-
manyok kandidatusa Itranslatori
Abstract theory of automatic inai:hirles. Pt. 1. Mvit, kozl WA
13 no,,3.287-309 '63.

GLUSHKOV, VJT., akad(zinik
Fecnomics and automation. Vest. AN SS-SR '33 no.1.0:11-14 0 163.
(mall 16:11)
1. AN UkrSSR.

51026115-1VOW1002100 WOW
A00VA1116
MiT:1,011
0111:311ROV, V. M., Acatieml-c'an oL' ihe Acsidemy cf Salimces UkrSSR
T.1"'Ll": "'iIIIIII,-itAon of' mental
D---ir~Aan, no. 2, 1ID6':,, 3 - 13
Y-YT: The author presents a dct.ailed survoy on the posiilbilLtIeB of simu-
::ierit3' processes with the aid of' modern cybernetic teelviiques, which Woull
SQi'Ve ~Is a t~asis for automating many kinds of Intellectual acl%Uvity of Man. He
t,..;o ba.-,ic forms of' such a ~Jtmilation, viz. the direot a nd indireot.
or phencmenologlcal form. In thin Cli%;1; oa-;e, Lhe main attenfl.on is focussad on
Nan's brain, thus 'he simulation of mental processes proper i4q obtal-ned as a
re
5ult o!; a 7iirniiation of the brain. in the 1--tLer case, i. e. in indirect simu-
I.itlrin, (,,nly thp 1;,eneral course of mental processes io reproduced, thD regulari-
)Vor frorm one thour!~Iit t(.-) an-)th,-,r. The authov'givctj ah desorip-
L lord of' thr, br,--iin mo., ~~I and Ito [t--,nj.n , pi-asonts a number, of exuples of
-1 g,
111117,3rytILTiLe descrLptions and codirVr oC i,.mnl;~i.! processea, am]. attempts to answer
Car,~ 1112

S102G16:VOOO1OO2VOOl1W1
,';-~mlulati~-jn of' rxntal processes A0041A 1,26 .0.
,liv-, ju(~stf.on, iiicther I-'- is p,)~-,-Ibl-,! scientific work. He then de-
t'-- "~ilriulation of procnsse-,~ 11 -n,i r'l,.-at ion and d1iiarimillation, COM-
ments In detail an thel \practice of t-~-,Jnin, r:;-chIn,:s for, parfoxming.mental oper'a-
tioa5, and states that everything that hp~; lr,,een achieved In W-1a) fleld h1therto
lps towLnJ:; developing a general theory an self-or-
the
is nothinj3 but first sto
g~jnizii-4t, f;ystf,m,-, -ti a basis for the 7,jiim1,-iLk;fi of' mental proco!ones, lhere Am
ASSOCIATION: All USSR (A.S UkrSSR), Kiyov
Card 2/2

that we are dealing With i.nfbr.mat on ~:~CohdtL 06 DbJe~t
rd
L 31274-65
]kCCESSION NR: ARS004814,
is at our disposal
The means of fixing any ~coiidrete, i' E ioW
.the author's opinion "are Oquages'; iftot!! dn15 140
i i4 i:
are.studied by traditionalAx.ngOiOtiool, ~!at ry
nn r U~6bnd d r
lartminerp-st. wfitn'h arn v- mt ii 1 1", ~:

IOU

:I ur4 of 0
Ip
C' im; pr v 'Oi~l i b a' s

Tilatter.
tMilli
On
gi-:10idt
an

even sucn projects as zae proouction;oxan
P.;]! 1.
.3/4
Mn A I of,~ un-,
lie p ot
!oV tioin: the
realit
I y ovei~yt
6t a:~tcia;

!ijt
4/4

rw-il,,~ Fnxltmalj~ 1.,fJiaqt.i -e
LnSF:~,,, A'
1 - V I . FAVLENKO., Y
rct,.3onzeW

u'LI,,7'D"KO7, "-M- (K -; ~ ., -.7)
__,;- ,,
, ~ ~. 4,,' L
", " a -:-~ t.r, , . I
tl - . . I I
~' i:--~ 0
'I' TF,-~,h. llt~. 1 ~';
'n ' -'~ ~!, '; 7,-
1~ 11 ""
(!;: 1: "!. ? ,-,

jj~~ ilk
xi
7~ f
16-

-I I I , i - - " ;:;: : - : - . "I - ~ I
1; 1. "1, , j:~ ii ; :;~!~ i_ 1 (! ~..;y J ~ 1:11- 11. . . . ! - !, I
. . ." i, .. , . , N
7 . ;
S,~'.t7l` J,~ Ili 0; 1 1 '~ ~ - :~ .; ,

I r-:!d.
GLUS11YOV, Vikto.- '-'ikhlaYIO',~ icil, akademix; --; ~ .-, ~
[Cybernetics and Trental .;rjry:l zrd.
.7ud. vo:,', 5. 45 P- (11()"0e v
rp ~va, Zrianie, 1OJ6
yi t
nauke, tekilnike. 1"AH",
nomiia, no.15)

, I . ..
1 ~Z I . .. - ~. I I . . I I ! , . ,
. . I . . I ... ): 4 - . I I
I. ~ I . . ~ I f . ; - 1 , , N
.I .- i.. .L . I.. f1.,

SOMCE-. FAbernetiks, no. ii. 1965, 341
TOPICTAGS: iaanite a 64~npiifor tic. t
atomaton, auto ta'(t4he~ry~ 0
* automatic cot eal
c0 tq,.. ktrol oysibm mqm:lr: -d
MPU
ABSTRACT-.' The development of the abstrgct~thedry~4 ~6~~4;db
matit a presehtly'in the dire6do6 of JMW iata~ tf
prwen a400,
Ppro.,... on.
ed

ASSOCIATION: Ndhe
J

wBmrrTED: o8Novs4

OOD I
IP A;~ ;J,

NO REP SOV. 003 002
OTHER. ;
1j,

jV I
2/2
Cal

77. 17, U

11,77

]""Iw
4/fleb/Pk.4- -Xj-~:
q.,4
P
"A
ACCMION XR: AP50:(M5 04W
6:'681,~ 14 ii 0
A k'
AUT110M.' Glushkov, V. M.; Utl
A 0
TITLE: Input languages for an eogineer':ing'a co
ign 1:h utof
SOURCE:* Kibernettki no. 1, 1965, 74-82
1-1~i
0.1~ 60
TOPIC. TAGS: computer language, engin"ring deslp~ computeri 6dj 1~'ed Al
r0
d6gw e ~Jjlg ci~ LOW0116 '113 :!~J'
ABSTRAQT: An input language for, a 6.m~ui.0,iednitki-ked for
described. The machine should: 1) handlo, lftftite4 &',bbleii~ s fti6e ble 0 1 00're it J~
c ('11, Aatd!'
smval aiin'(nmt of inlUal data; 2) use a sim0te-InPut lfuiguag6 eu
3) handle the problem completely automaUcally; 4)fnp~rp6rate 1~ ca47 lvlenC tjolk.

7.V~V.tw PKwOt;uLs; 1) me DaSIC SYMMS, 1MOKILMOrS., lmd JIUMbers , 1
A
,~.~103rd 1/2
!PMq9Pi y
f ;T1.

4 IV with! do'lples,

J11

LUI H,'. C V ak a~,:o :Ak e Kl L S K lY , L . A d T-'-" L-`A , L. A
fica t ion nnd '!u toma tion or procc,:;:;e:- I-, j a ~- j III,
ldato- :ualiLy]
se ~sw.
:~~,gmlllrnv~.tnl in acht~:-tva vociv. Elle'!, '111-t tel:hn.
infocmall:--ii, 190- 20-1- p. 17:3)
1. Akadej iya muk I f,w (-,lu:;hkcv)
korrer,pon,;ent Ali tjkv.S~Slt (~'Or

GLUSKHUV) V.M. [Hiushkov,, V.1-1.,]
Young, omnipresent and powerful... Znaa. ta pruLsie. U0.1:3-4 Ja '63-
(141RA 16:3)
1. Vit.,e-prezident AN UkrS61i, i direktor Instituta kkil>~rnetiki AN Ukr6S.R.
(Cybernetics)

ACCESSION NR: AP4015Z86 5/0280/64/0001001/0003/0006
AUTHOR: Glushkov, V. M. (Kiev)
TITLE: Using the absiract automatca theory for minimizing microprograms
SOURCE. AN SSSR. Izvestiya. Tekhnicheakaya kibernetikeL. no. 1, 1964. 3-8
TOPIC TAGS: computer microprogram, computer microprograming, minirr&.ing
computer microprogram, computer microprogram theory, Moor automaton
ABSTRACT: As the microprogranvdrg of computers has become very complicated,
formalized methods of synthesizing and minimizing the microprograms have
become necessary. The theory of abstract automatons is suggested for solving
this problem. The author conoi-ders two types of mioroopexvtjorw (arA, correspmd-
:Lr4~11,y, m,'croinstructions): (1) external micro-
operations that cause conversion oi information In the arithmetical unit and
(2) internal microoperations that influence, the contyol unit. A microprogr-im

ACCESSION NR: AP4015Z86
ilf = AIA,...A. is represented by the Moor automaton whose statoo are identical
with the instructions of the microprograrn. The final microcorn.Triand jk ,
represents the first microcommand of the next microprogram. The number of
states of the A-automaton can then be minimized, which will result in minimizing
the microprogram. An example of minimizing the program of division of two
numbers is set forth in detail. The above method yields particularly important
savings in minimizing complicated sets of microprograms. Orig. art. has:
7 tables.
ASSOCIATION: none
SUBMITTED: I3Nov63
DATE ACQ: IZMar61
ENCL: 00
SUB CODE: CP
NO REF SOV: 00 1
OTHER; 000
Card 2/2

AP6001195
SOURCE CODE:
U11/0378/63/000/005/0001/0009
AUTHOR: Glushkov, V. M. (Academician; Director)
ORG: none
TITLE: Theory of automata and formal transformation of microprograms
SOURCE: Kiberneti4, no. 5, 1965, 1-9
it
TOPIC TAGS: _9lflet8t+e ry, f ram
transformation, electronic computer design ,,, I/
IL
ABSTRACT: The author stresses that in dcsigning the principal blocks (block
designing) of electronic computers, the computer is usually connilleyedpo pti-abstract.
automaton. However, successful application of the abstract the "" f ta In
~._automa
..2EL 0
designing of computers is difficult. In his previous article (Theory of automata
and problems in designing the structure of digital computers. ld'bernetika, no. 1,
1965), the author outlined a formal approach to block designing of computers and In
the present article, he deals with further development of his previously presented
ideas, Here he constructs a formal mathematical apparatus which makes it possible
to apply sufficiently effectively the methods of abstract autom-tita and other algebra.~.
ic methods to block designing of computers. The starting idea, uhicli is the basis
on which the proposed theory is developed, consists in repreaenting an electroric
computer as the composition of two automata: operational and control1ing automata
UDC: 519.

ACC NRt AP6001195
(terminology introduced by the author). Formulations of nuch automata tire given and
the concepts of a micro-operation (transformation of the net of statur of an oper-
ational automaton into itself) and of a microprogram (a sequenco of Pricroinutruc-
tions, each of which coincides with a certain micro-operation) are introduced.
It is explained how the problem of opiimiwing the structure of electronic computers
is related to the transformation of microprograms. To develop a technique for
transforming microprograms, a special algebratc apparatus and ah specLal language
for writing microprograms are presented on the basis of the concept or the system
of microprogram algebras developed by the author in the article. It Is sho,,m how,
by using certain relations in the corresponding pair of micro 1) ro grant al.gebras, the
necessary microprogram can be transformed Into the more econom.1cal form which is
usually used in performing the operation of multiplication. Th-v concept: of a regu-
lar microprogram is introduced. A theorem is proved establWiling that every micro-
program can be represented in a regular form and that an algorithin for such trans-
formation exists. The problem of formal transformation of nileroprogtaMS 19 analy2ed
and the procedure for such transformation is presented. An example illustrates this
procedure. Orig. art. has: 2 figures and 31 formulas. ILK]
SUB CODE: 12,09./ SUBM DATE: OlJul65/ ORIG REF: 004/ ATD 1.,RES!;:

L 044,?8-67 ( d ) P ( 1 )IJN r ) :1)
AGC DIR: AT6014293 SOURCE CODF: URI'0000/65/000/000/034Z/0345
AUTHOR' Gluidikov, V. M. (SSS10; L,ctic1i,!vHhv, A. A. (~'),5SR)'
7?
ORG: none
TITLE: Algorithmic system for automating the synthesis of digLt;jl au
. . _ _jomata
SOURCE: International Symposium on the Theory of Relay S,rskgrjjp._-jDd Finite
Automata. Moscow, 1962. Sintez releynykh struktur (Synthesis of relay
structures); trudy simpoziuma. Moscow, Izd-vo Nauka, 1965, 342-345
TOPIC TAGS: discrele automaton
ABSTRACT: Progrram~tre being developed (at the Ins tjtqt-g ALjy-Lu:avjjca) for
abstract, structural, and combinational synthesis of digital automata an a general-
purpose digital computer. As input information, these fornis are used: (1) A set
of regular formulas (for abstract synthesis); (Z) A flow and output table (for
structural synthesis); (3) A system of drif Boolean functions, i.e. , the automaton
Card 1/2

L-9~- LWT(d1--IJ2-(o) -- - - - - -- - - . --- . - -
ACC NRi AP6035581 SOURCE CODE1 UR/0378/66/000/005/0001/00"3
i 3-1
AUTHOR: Glushkov, V. M. (Academician AN UkrSSR)
ORG: none
~TITLE: On tile problem of minimizing tile microprogram and the schemea of algorithms
iSOU`RCE: Kibernetika, no. 5, 1966, 1-3
TOPIC TAGS: cybernetics, finite minimization,
c~
jABSTRACT: The author points out that In his previous article (Kibernetika, no. 5,
1965, 1-9) it is shown that tile performance of an arbitrary microprogram can be
reduced to a scheme of the Interaction of two"'~h'utomata A and B. Automaton A is
called operational and represents a finite or infinite 'Moore automaton, while B is
called a control automaton and represents a finite Mealy automaton. Output signals
(XI) X2) ... Xm) of A are input signals for B, and output signals of 13 (microoperatione
YI .... Yn) are input signals for A. It is assumed that the iiittiaL state b0 of B is
fixed, while the initial state of A can vary within certain bound!;. The described
,coupling existing between the performance of A and B enables the author to conclude
ithat not all a priori sequences of signals will appear at the input of B even when
!it is possible to select any initial state oE A. In this fact, the author sees an
iadditional possibility of minimizing the control automaton B and the microprogram
,which B represents. A method for realizing this possibility is developed which is
! Card 1/2 UDC; 519.95 ------ -

.L o852247,
ACC NRt AP6035581
baned on the construction of finite automata w1ach are callef-i reductLon automata.
;'I'ne procedure for constructing reduction automata and for substituting the partial
!automaton B for B as well as an iterative procedure for determining the sequence of
!partial automata are presented. An example illustrates the procedure developed
!here for minimizing the microprogrmB. Orig. art. has: I formula.
SUB CODE: 06SUBM DATE: 16Jun66/ ORIG REF: 003/ ATD PRESS: 5lU3
1s
Cord _7/2_

GLUSHKOV, V.N., inzhener.
On setting up a tolerance and allipwance i37stem for the mech=ical
machining of forgings; our experience. 78st.mash. 27 ne.12:66-71
D 147. (W.U. 9:4)
(Tolerance (Enginnering))(Machine-shop practice)(F*rging)

OLU3HKOV) V..
USSR/Metallurgy - Forging, Equipment
Oc L 52
"A New Type Forge Shop,~' 1'. Glushkov, Strilin Frice Laureate
Za Ekon Rqterialov, No 3, pp 69-72
Describes forae shop recently openod at one of Moscow pli-itits, stat'Ing that there
is no similar sh6p in whole world. All oreratings are perf~ivrned with the Pid of
electricity. Modern equipment, such as induction furtinciL,.s !ind forging pres!3135,
permit high degree of meclLqnization find autDi~iation. S'tetes that udxanced forcing
pzactice will reduce metql consumption not. only in Corge shop but -,-Iso in
machining operations, raising totR1 coeff of metal utilization in ffinal product
from 0.55 to 0.7C.
,/wjxce #261,T62

1. GLUSHKOV. V.N.
2. UbSR (6oo)
4. Forging
7. New t.,-pe of blacksmith shoo in q machine buildiri~; plant. Vnrit. marki.
32, no. 8, 1952.
9. Monthly List of Russian Accessions, Library of Congress, P-9bruary-1953, Unclassified.