About Some Properties of Definite, Reverse-Definite and Related Automata
- 1 October 1966
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-15 (5) , 806-810
- https://doi.org/10.1109/pgec.1966.264264
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- Ultimate-Definite and Symmetric-Definite Events and AutomataJournal of the ACM, 1965
- On homomorphic images of transition graphsJournal of the Franklin Institute, 1964
- The Theory of Definite AutomataIEEE Transactions on Electronic Computers, 1963
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959