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
B.H. Barnes, Dep. Comput. Sci. Pennsylvania State Univ.
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.