DocumentCode
1992367
Title
Logspace and logtime leaf languages
Author
Jenner, Birgit ; Mckenzie, Pierre ; Thérien, Denis
Author_Institution
Fak. fur Inf., Tech. Univ. Munchen, Germany
fYear
1994
fDate
28 Jun- 1 Jul 1994
Firstpage
242
Lastpage
254
Abstract
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
Keywords
Turing machines; computational complexity; formal languages; theorem proving; complexity classes; formal languages; leaf language mechanism; logarithmic space; logarithmic time computation; logspace leaf languages; logtime leaf languages; machine-independent relativization; nondeterministic Turing machine; polynomial time computation; Computer science; Natural languages; Polynomials; Turing machines; Turning;
fLanguage
English
Publisher
ieee
Conference_Titel
Structure in Complexity Theory Conference, 1994., Proceedings of the Ninth Annual
Conference_Location
Amsterdam
Print_ISBN
0-8186-5670-0
Type
conf
DOI
10.1109/SCT.1994.315799
Filename
315799
Link To Document