DocumentCode :
958437
Title :
On the Existence of a Periodic Analog of a Finite Connected Automaton
Author :
Reischer, C. ; Simovici, D.A.
Author_Institution :
Department of Mathematics, University of Jasi, Jasi, Romania.
Issue :
2
fYear :
1972
Firstpage :
208
Lastpage :
211
Abstract :
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.
Keywords :
Adaptive systems; Electrons; Learning automata; Machine learning; Numerical analysis; Pattern recognition; Periodic structures; Polynomials; Time varying systems; Tin; Automaton with periodic-variable structure; Boolean matrix; Moore automaton; characteristic Boolean vector; connected graph; partition; time-varying Moore automaton;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1972.5008929
Filename :
5008929
Link To Document :
بازگشت