This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
October 1971 (vol. 20 no. 10)
pp. 1211-1214
F.R. Moore, IEEE
The bounds on state-set size in the proofs of the equivalence between nondeterministic and deterministic finite automata and between two-way and one-way deterministic finite automata are considered. It is shown that the number of states in the subset machine in the first construction cannot be reduced for certain cases. It is also shown that the number of states in the one-way automation constructed in the second proof may be reduced only slightly.
Index Terms:
Automata theory, equivalence proofs, finite automata, nondeterministic automata, two-way automata, upperbound.
Citation:
F.R. Moore, "On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata," IEEE Transactions on Computers, vol. 20, no. 10, pp. 1211-1214, Oct. 1971, doi:10.1109/T-C.1971.223108
Usage of this product signifies your acceptance of the Terms of Use.