This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Periodic Equivalents of Finite Automata
October 1975 (vol. 24 no. 10)
pp. 991-994
T. Gajewski, Department of Electrical Engineering, Technical University of Poznan
This correspondence deals with the problem of finding periodic equivalents of finite automata, The idea of periodic equivalent is a generalization of the concept of strictly periodic equivalent studied in [4]. In this correspondence some essential properties of periodic equivalents of finite automata are investigated. Further-more, the concept of strong kernel of automaton is introduced and some connections of strong kernels with periodic equivalents are presented. Finally, the algorithm for determining minimal periodic equivalents of automata is given.
Index Terms:
Cyclic subautomaton of periodic equivalent, equivalence of automata, generating system, minimal periodic equivalent, operation of (t, T)-numeration, periodic equivalent of automaton, state splitting, strong kernel of automaton.
Citation:
T. Gajewski, "On the Periodic Equivalents of Finite Automata," IEEE Transactions on Computers, vol. 24, no. 10, pp. 991-994, Oct. 1975, doi:10.1109/T-C.1975.224107
Usage of this product signifies your acceptance of the Terms of Use.