|
| 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
| ASCII Text | x | ||
| 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, October, 1971. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1971.223108, author = {F.R. Moore}, title = {On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata}, journal ={IEEE Transactions on Computers}, volume = {20}, number = {10}, issn = {0018-9340}, year = {1971}, pages = {1211-1214}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1971.223108}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata IS - 10 SN - 0018-9340 SP1211 EP1214 EPD - 1211-1214 A1 - F.R. Moore, PY - 1971 KW - Automata theory KW - equivalence proofs KW - finite automata KW - nondeterministic automata KW - two-way automata KW - upperbound. VL - 20 JA - IEEE Transactions on Computers ER - | |||
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.