|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
A Two-Way Automaton with Fewer States than Any Equivalent One-Way Automaton
April 1971 (vol. 20 no. 4)
pp. 474-475
| ASCII Text | x | ||
| B.H. Barnes, "A Two-Way Automaton with Fewer States than Any Equivalent One-Way Automaton," IEEE Transactions on Computers, vol. 20, no. 4, pp. 474-475, April, 1971. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1971.223273, author = {B.H. Barnes}, title = {A Two-Way Automaton with Fewer States than Any Equivalent One-Way Automaton}, journal ={IEEE Transactions on Computers}, volume = {20}, number = {4}, issn = {0018-9340}, year = {1971}, pages = {474-475}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1971.223273}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - A Two-Way Automaton with Fewer States than Any Equivalent One-Way Automaton IS - 4 SN - 0018-9340 SP474 EP475 EPD - 474-475 A1 - B.H. Barnes, PY - 1971 KW - Finite automaton KW - one-way automaton KW - regular sets KW - two-way automaton. VL - 20 JA - IEEE Transactions on Computers ER - | |||
This correspondence presents an example of a two-way automaton which has significantly fewer states than any one-way automaton accepting the same set of tapes. Thus, in this particular case, memory space can be saved by using a two-way automaton. This savings in space, however, is accompanied by an increase in recognition time.
Index Terms:
Finite automaton, one-way automaton, regular sets, two-way automaton.
Citation:
B.H. Barnes, "A Two-Way Automaton with Fewer States than Any Equivalent One-Way Automaton," IEEE Transactions on Computers, vol. 20, no. 4, pp. 474-475, April 1971, doi:10.1109/T-C.1971.223273
Usage of this product signifies your acceptance of the Terms of Use.