TY - JOUR
T1 - About Some Properties of Definite, Reverse-Definite and Related Automata
AU - Ginzburg, A.
PY - 1966/10
Y1 - 1966/10
N2 - For reduced finite Moore automata corresponding to regular expressions which are finite sums of expressions of the form E+Hσ*G (E,H, G are finite events and σ is the set of inputs) it is shown that an arbitrary change of the initial state or of the set of final states results in an automaton belonging to the same class. The transition graphs corresponding to the single inputs in definite and reverse-definite automata are investigated.
AB - For reduced finite Moore automata corresponding to regular expressions which are finite sums of expressions of the form E+Hσ*G (E,H, G are finite events and σ is the set of inputs) it is shown that an arbitrary change of the initial state or of the set of final states results in an automaton belonging to the same class. The transition graphs corresponding to the single inputs in definite and reverse-definite automata are investigated.
UR - http://www.scopus.com/inward/record.url?scp=0002345674&partnerID=8YFLogxK
U2 - 10.1109/PGEC.1966.264264
DO - 10.1109/PGEC.1966.264264
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0002345674
SN - 0367-7508
VL - EC-15
SP - 806
EP - 810
JO - IEEE Transactions on Electronic Computers
JF - IEEE Transactions on Electronic Computers
IS - 5
ER -