{"title":"Logspace and logtime leaf languages","authors":"Birgit Jenner, P. McKenzie, D. Thérien","doi":"10.1109/SCT.1994.315799","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"97 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"56","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCT.1994.315799","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 56
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.<>