Relating Refined Space Complexity Classes

  title={Relating Refined Space Complexity Classes},
  author={Joel I. Seiferas},
  journal={J. Comput. Syst. Sci.},
Refined Turing machine space complexity classes are defined by limiting all three of the resources space, worktape alphabet size, and number of worktape heads. Containment relations among the classes are proved and used to convert a few basic noncontainment relations to noncontainment relations of four more homogeneous types: "less space" (conventional classes), "fewer worktape symbols," "one fewer worktape symbol," and "fewer worktape heads." Noncontainment results for both nondeterrninistic… CONTINUE READING