On the Tape Complexity of Deterministic Context-Free Languages

@article{Sudborough1978OnTT,
  title={On the Tape Complexity of Deterministic Context-Free Languages},
  author={I. H. Sudborough},
  journal={J. ACM},
  year={1978},
  volume={25},
  pages={405-414}
}
Let DSPACE(L(n)) denote the family of languages recognized by deterministic L(n)-tape bounded Turmg machines The pnnopal result described m this paper is the equivalence of the following statements (l) The determtmsttc context-free language L~ 2) (described m the paper) is m DSPACE(Iog(n)) (2) The simple LL(I) languages are m DSPACE(tog(n)) (3) The simple precedence languages are in DSPACE(Iog(n)). (4) DSPACE(Iog(n)) is identical to the famdy of languages recogmzed by deterministic two-way… Expand
Tree-size bounded alternation(Extended Abstract)
Tree-Size Bounded Alternation
  • W. L. Ruzzo
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1980
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
Time and Tape Bounded Auxiliary Pushdown Automata
On the power of polynomial time bit-reductions
...
1
2
3
4
5
...