A NOTE ON MULTIHEAD FINITE-STATE AUTOMATA

Ioan I. Macarie · International Journal of Foundations of Computer Science · 1996

We present connections among nondeterministic and one-sided-error probabilistic multihead finite-state automata. Several properties of logarithmic-space Turing machines follow from the more refined results that we prove in the setting of the corresponding multihead finite-state automata.

Read the paper · More papers on PaperTik