This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Mathematical Model of Finite Random Sequential Automata
January 1968 (vol. 17 no. 1)
pp. 27-31
Florin Stuanciulescu, Computation Laboratory of the Electrical Research Institute, Bucharest, Rumania.
Mihai Francisc Anton Oprescu, Center of Economic Computation and Economic Cybernetics, Bucharest, Rumania.
The sequential logic theory previously advanced[2] is generalized to operations between variables of maximum word length n. Based on the generalized sequential logic operations, a new kind of probability, termed sequential probability, is introduced. By means of sequential probability, a mathematical model can be obtained for finite random sequential automata. This model can be used for analysis and synthesis of random sequential automata.
Citation:
Florin Stuanciulescu, Mihai Francisc Anton Oprescu, "A Mathematical Model of Finite Random Sequential Automata," IEEE Transactions on Computers, vol. 17, no. 1, pp. 27-31, Jan. 1968, doi:10.1109/TC.1968.5008865
Usage of this product signifies your acceptance of the Terms of Use.