Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties-Reference-Cited by-同舟云学术

Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties

Published:1988-12 Issue:1 Volume:21 Page:1-17
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Ibarra Oscar H.,Ravikumar Bala

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

Reference21 articles.

1. Lecture Notes in Computer Science;M. Alberts,1986

2. Alt, H. and K. Mehlhorn, A language over a one-symbol alphabet requiring onlyO(log logn) space,SIGACT Newsletter, Nov.–Dec. 1975.

3. Alt, H., Lower bounds on space complexity for context-free recognition,Acta Informatica,12 (1979), 33–61.

4. Chang, J., O. Ibarra, M. Palis, and B. Ravikumar, On pebble automata,Theoretical Computer Science,44 (1986), 111–121.

5. Chang, J., O. Ibarra, T. Jiang, and B. Ravikumar, Some languages in NC1 (submitted for publication).

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

1. Two-Way Non-Uniform Finite Automata;International Journal of Foundations of Computer Science;2022-12-12

2. Two-Way Non-uniform Finite Automata;Developments in Language Theory;2021

3. Determinism and Nondeterminism in Finite Automata with Advice;Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications;2018

4. Two-Way Automata Versus Logarithmic Space;Theory of Computing Systems;2013-04-11

5. Two-Way Automata versus Logarithmic Space;Computer Science – Theory and Applications;2011