Benton L. Leong
- 1 AANDERAA, S.O. On k-tape versus (k - l)-tape real time computation. In Complexity of Computation (SIAM-AMS Proceedings, Vol. 7), R.M. Karp, Ed., American Mathematical Society, Providence, R.I., 1974, pp. 75-96.Google Scholar
- 2 BENr~ISOr~, V.L. Saving tapes in the simulation of multihead Turing machines. SIGACT News 6, 2 (April 1974), 23-26. Google Scholar
- 3 FISCHER, M.J. Personal communication.Google Scholar
- 4 FISCHER, M.J., AND ROSENBERG, A.L. Limited random access machines (preliminary version). IEEE Conf. Rec. 9th Ann. Syrup. on Switching and Automata Theory, Schenectady, New York, 1968, pp. 356-367.Google Scholar
- 5 FlSCHER, P.C., MEVER, A.R., AND ROSENBERG, A,L. Real-time simulation of muhihead tape units. J. ACM 19, 4 (Oct. 1972), 590-607. Google Scholar
- 6 GALIL, Z., AND SEIFERAS, J.i. Saving space in fast string-matching. SIAM J. Comput. 9, 2 (May 1980), 417-438.Google Scholar
- 7 HARTMANIS, J., AND STEARNS, R.E. On the computational complexity of algorithms. Transactions of the American Mathematical Society, Vol. 117, American Mathematical Society, Providence, R.I., 1965, pp. 285-306.Google Scholar
- 8 HENNIE, F.C. On-line Turing machine computations. IEEE Trans. on Electron. Comput. EC-15, l (Feb. 1966), 35-44.Google Scholar
- 9 KATSEFF, H.P. A new solution to the critical section problem. Proc. 10th Ann. ACM Symp. on Theory of Computing, San Diego, California, 1978, pp. 86-88. Google Scholar
- 10 KOSARAJU, S.R. Personal communication.Google Scholar
- 11 KOSARAJU, S.R. Real-timesimulationofconcatenabledouble-endedqueuesbydouble-endedqueues (preliminary version). Proc. 1 lth Ann. ACM Symp. on Theory of Computing, Atlanta, Ga., 1979, pp. 346-351. Google Scholar
- 12 LEONG, B.L., AND SEIFERAS, J.I. New real-time simulations of multihead tape units. Proc. 9th Ann. ACM Symp. on Theory of Computing, Boulder, Colo., 1977, pp. 239-248. Google Scholar
- 13 PAUL, W.J., SEIFERAS, J.I., AND SIMON, J. An information-theoretic approach to time bounds for online computation. Proc. 12th Ann. ACM Symp. on Theory of Computing, Los Angeles, Calif., 1980, pp. 357-367. Google Scholar
- 14 PETERSON, G.L., AND FISCHER, M.J. Economical solutions for the critical section problem in a distributed system (extended abstract). Proc. 9th Ann. ACM Symp. on Theory of Computing, Boulder, Colo., 1977, pp. 91-97. Google Scholar
- 15 RIVEST, R.L., AND PRATT, V.R. The mutual exclusion problem for unreliable processes (preliminary report). 17th Ann. IEEE Symp. on Foundations of Computer Science, Houston, Texas, 1976, pp. 1-8.Google Scholar
- 16 ROGERS, H. JR. Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York, 1967. Google Scholar
- 17 SLISENKO, A.O. Recognition of palindromes by multihead Turing machines. In Problems in the Constructive Trend in Mathematics. VI (Proceedings of the Steklov Institute of Mathematics, No. 129), V.P. Orevkov and N.A. Sanin, Eds., Academy of Sciences of the USSR, 1973, pp. 30-202; English translation by R.H. Silverman, American Mathematical Society, Providence, R.I., 1976, pp. 25-208.Google Scholar
- 18 STEARNS, R.E., HARTMANIS, J., AND LEWIS, P.M. II. Hierarchies of memory limited computations. IEEE Conf. Rec. on Switching Circuit Theory and Logical Design, Ann Arbor, Michigan, 1965, pp. 179-190.Google Scholar
- 19 STOSS, H.J. k-Band-Simulation von k-Kopf-Turing-Maschinen. Comput. 6, 3 (1970), 309-317.Google Scholar
Index Terms
- New Real-Time Simulations of Multihead Tape Units
Recommendations
New real-time simulations of multihead tape units
STOC '77: Proceedings of the ninth annual ACM symposium on Theory of computingJust as the Church-Turing thesis has simplified proofs of computability [8], efficient simulations of one computer model by another have simplified proofs of complexity upper bounds. A good example of this is Fischer, Meyer, and Rosenberg's real-time ...
On tape-bounded complexity classes and multihead finite automata
The principal result described in this paper is the equivalence of the following statements:o(1)Every set accepted by a nondeterministic one-way two-head finite automaton can be accepted by a deterministic two-way k-head finite automaton, for some k. (2)...
On stateless multihead automata: Hierarchies and the emptiness problem
We look at stateless multihead finite automata in their two-way and one-way, deterministic and nondeterministic variations. The transition of a k-head automaton depends solely on the symbols currently scanned by its k heads, and every such transition ...
Comments