Logspace and logtime leaf languages

摘要

Leaf languages were used in the context of polynomial time computation to capture complexity classes and to study machine-independent relativizations. In this paper, the expressibility of the leaf language mechanism is investigated in the contexts of logarithmic space and of logarithmic time computation.