G. Ramalingam
Theoretical Computer Science
Paper
A note on the reduction of two-way automata to one-way automata
Abstract
We describe a new elementary reduction of two-way automata to one-way automata. The reduction is based on the subset construction rather than on crossing sequence analysis. © 1989.
Related
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Thomas R. Puzak, A. Hartstein, et al.
CF 2007