Real-time solutions of the origin-crossing problem-Reference-Cited by-同舟云学术

Real-time solutions of the origin-crossing problem

Published:1968-09 Issue:3 Volume:2 Page:257-263
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Fischer Michael J.,Rosenberg Arnold L.

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/BF01694010.pdf

Reference4 articles.

1. P. C. Fischer, A. R. Meyer andA. L. Rosenberg, Counter machines and counter languages,Math Systems Theory 2 (1968), 265–283.

2. J. Hartmanis andR. E. Stearns, On the computational complexity of algorithms.Trans. Amer. Math. Soc. 117 (1965), 285–306.

3. R. Laing, Realization and complexity of commutative events,Univ. of Mich. Tech. Report 03105-48-T, 1967.

4. A. L. Rosenberg, Real-time definable languages,J. Assoc. Comp. Mach. 14 (1967), 645–662.

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

1. MIX is a 2-MCFL and the word problem in Z2 is captured by the IO and the OI hierarchies;Journal of Computer and System Sciences;2015-11

2. ON REAL-TIME WORD PROBLEMS;Journal of the London Mathematical Society;2003-03-24

3. Relations among simultaneous complexity classes of nondeterministic and alternating Turing machines;Acta Informatica;1993-03

4. Counting is easy;Journal of the ACM;1988-10

5. Adding range restriction capability to dynamic data structures;Journal of the ACM;1985-07