article

Free access

New Real-Time Simulations of Multihead Tape Units

Authors:

Benton L. Leong and

Joel I. SeiferasAuthors Info & Claims

Journal of the ACM (JACM), Volume 28, Issue 1

Pages 166 - 180

https://doi.org/10.1145/322234.322246

Published: 01 January 1981 Publication History

PDF eReader

References

[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.

Crossref

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.

Crossref

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.

Crossref

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.

Crossref

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.

Crossref

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.

Crossref

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.

Crossref

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.

Crossref

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

Cited By

View all

Crespi Reghizzi SSan Pietro P(2020)Deque automata, languages, and planar graph representationsTheoretical Computer Science10.1016/j.tcs.2020.02.029Online publication date: Feb-2020
https://doi.org/10.1016/j.tcs.2020.02.029
Crespi Reghizzi SSan Pietro P(2018)Deque Languages, Automata and Planar GraphsDevelopments in Language Theory10.1007/978-3-319-98654-8_20(243-255)Online publication date: 5-Aug-2018
https://doi.org/10.1007/978-3-319-98654-8_20
Montoya J(2015)Open problems related to palindrome recognitionJournal of Automata, Languages and Combinatorics10.5555/3173499.317350120:1(5-25)Online publication date: 1-Jan-2015
https://dl.acm.org/doi/10.5555/3173499.3173501
Show More Cited By

Index Terms

New Real-Time Simulations of Multihead Tape Units
1. Computing methodologies
  1. Modeling and simulation
2. Theory of computation
  1. Models of computation
    1. Computability
      1. Turing machines

Recommendations

New real-time simulations of multihead tape units
STOC '77: Proceedings of the ninth annual ACM symposium on Theory of computing

Just 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 ...
Read More
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)...
Read More
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 ...
Read More

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 28, Issue 1

Jan. 1981

190 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/322234

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1981

Published in JACM Volume 28, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

44
Total Citations
View Citations
433
Total Downloads

Downloads (Last 12 months)24
Downloads (Last 6 weeks)4

Other Metrics

View Author Metrics

Citations

Cited By

View all

Crespi Reghizzi SSan Pietro P(2020)Deque automata, languages, and planar graph representationsTheoretical Computer Science10.1016/j.tcs.2020.02.029Online publication date: Feb-2020
https://doi.org/10.1016/j.tcs.2020.02.029
Crespi Reghizzi SSan Pietro P(2018)Deque Languages, Automata and Planar GraphsDevelopments in Language Theory10.1007/978-3-319-98654-8_20(243-255)Online publication date: 5-Aug-2018
https://doi.org/10.1007/978-3-319-98654-8_20
Montoya J(2015)Open problems related to palindrome recognitionJournal of Automata, Languages and Combinatorics10.5555/3173499.317350120:1(5-25)Online publication date: 1-Jan-2015
https://dl.acm.org/doi/10.5555/3173499.3173501
Purkayastha PBaras J(2013)Convergence results for ant routing algorithms via stochastic approximationACM Transactions on Autonomous and Adaptive Systems10.1145/2451248.24512518:1(1-34)Online publication date: 19-Apr-2013
https://dl.acm.org/doi/10.1145/2451248.2451251
Ligatti JBauer LWalker D(2009)Run-Time Enforcement of Nonsafety PoliciesACM Transactions on Information and System Security10.1145/1455526.145553212:3(1-41)Online publication date: 1-Jan-2009
https://dl.acm.org/doi/10.1145/1455526.1455532
Atallah MBlanton MFazio NFrikken K(2009)Dynamic and Efficient Key Management for Access HierarchiesACM Transactions on Information and System Security10.1145/1455526.145553112:3(1-43)Online publication date: 1-Jan-2009
https://dl.acm.org/doi/10.1145/1455526.1455531
Kandemir MOzturk O(2008)Software-directed combined cpu/link voltage scaling fornoc-based cmpsACM SIGMETRICS Performance Evaluation Review10.1145/1384529.137549836:1(359-370)Online publication date: 2-Jun-2008
https://dl.acm.org/doi/10.1145/1384529.1375498
Okasaki C(2008)Simple and efficient purely functional queues and dequesJournal of Functional Programming10.1017/S09567968000014895:04(583-592)Online publication date: 7-Nov-2008
https://doi.org/10.1017/S0956796800001489
Ambainis ASchulman LVazirani U(2006)Computing with highly mixed statesJournal of the ACM10.1145/1147954.114796253:3(507-531)Online publication date: 1-May-2006
https://dl.acm.org/doi/10.1145/1147954.1147962
Pitts A(2006)Alpha-structural recursion and inductionJournal of the ACM10.1145/1147954.114796153:3(459-506)Online publication date: 1-May-2006
https://dl.acm.org/doi/10.1145/1147954.1147961
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations