This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Existence of a Periodic Analog of a Finite Connected Automaton
February 1972 (vol. 21 no. 2)
pp. 208-211
C. Reischer, Department of Mathematics, University of Jasi, Jasi, Romania.
D. A. Simovici, Department of Mathematics, University of Jasi, Jasi, Romania.
The solution of the problem of the existence of an analog with periodic-variable structure of a given fixed-structure connected automaton is presented. Using a Boolean approach, a necessary and sufficient condition for the existence of the periodic analog is proven, and an algorithm that enables us to actually find this analog is given. The saving of the memory capacity needed for the construction of a given automaton is the main interest of the existence of a periodic analog.
Citation:
C. Reischer, D. A. Simovici, "On the Existence of a Periodic Analog of a Finite Connected Automaton," IEEE Transactions on Computers, vol. 21, no. 2, pp. 208-211, Feb. 1972, doi:10.1109/TC.1972.5008929
Usage of this product signifies your acceptance of the Terms of Use.