Real-time computations with restricted nondeterminism-Reference-Cited by-同舟云学术

Real-time computations with restricted nondeterminism

Published:1978-12 Issue:1 Volume:12 Page:219-231
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Fischer Patrick C.,Kintala Chandra M. R.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01776575.pdf

Reference15 articles.

1. S. O. Aanderaa, Onk-tape versus (k-1)-tape Real Time Computation, inComplexity of Computation, SIAM-AMS Proceedings, Vol. VII, 75–96 (1974).

2. R. V. Book, and S. A. Greibach, Quasi-Realtime Languages,Math. Systems Theory, 4, 97–111 (1970).

3. S. A. Cook, The Complexity of Theorem Proving Procedures,Proc. of 3rd Annual ACM Symposium on Theory of Computing, 151–158 (1971).

4. P. C. Fischer, Turing Machines with Restricted Memory Access,Inform. Control, 9, 364–379 (1966).

5. P. C. Fischer, A. R. Meyer, and A. L. Rosenberg, Real-Time Simulation of Multihead Tape Units,J. Assoc. Comp. Mach., 19, 590–607 (1972).

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Iterative arrays with self-verifying communication cell;Natural Computing;2020-11-05

2. Self-verifying Cellular Automata;Developments in Language Theory;2018

3. Shrinking one-way cellular automata;Natural Computing;2016-11-04

4. Complexity of One-Way Cellular Automata;Cellular Automata and Discrete Complex Systems;2015

5. Non-deterministic cellular automata and languages;International Journal of General Systems;2012-08