Computational power of one-way turing machines with sublogarithmic memory restrictions

Abstract

This paper considers the well-known Turing machine model, the nondeterministic real-time Turing machine. The author proves the existence of nonregular complexity classes of languages that can be recognized by nondeterministic one-way Turing machines with sublogarithmic memory restrictions. And these complexity classes form a strict hierarchy. The author defines a special language family and shows its properties to prove that hierarchy. © 2014 Allerton Press, Inc.