About Some Properties of Definite, Reverse-Definite and Related Automata
暂无分享,去创建一个
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.
[1] Micha A. Perles,et al. The Theory of Definite Automata , 1963, IEEE Trans. Electron. Comput..
[2] Bezalel Peleg,et al. Ultimate-Definite and Symmetric-Definite Events and Automata , 1965, JACM.
[3] J. Brzozowski. Canonical regular expressions and minimal state graphs for definite events , 1962 .
[4] Michael Yoeli,et al. On homomorphic images of transition graphs , 1964 .
[5] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..