{"title":"非统一复杂性度量的统一表征","authors":"José L. Balcázar, Josep Díaz, Joaquim Gabarró","doi":"10.1016/S0019-9958(85)80026-7","DOIUrl":null,"url":null,"abstract":"<div><p>Non-uniform complexity measures originated in automata and formal languages theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several computational models. It is shown to be closely related to context-free cost, boolean circuits, straight line programs, and Turing machines with sparse oracles and time or space bounds.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 53-69"},"PeriodicalIF":0.0000,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80026-7","citationCount":"16","resultStr":"{\"title\":\"Uniform characterizations of non-uniform complexity measures\",\"authors\":\"José L. Balcázar, Josep Díaz, Joaquim Gabarró\",\"doi\":\"10.1016/S0019-9958(85)80026-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Non-uniform complexity measures originated in automata and formal languages theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several computational models. It is shown to be closely related to context-free cost, boolean circuits, straight line programs, and Turing machines with sparse oracles and time or space bounds.</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":\"67 1\",\"pages\":\"Pages 53-69\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80026-7\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995885800267\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995885800267","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
Uniform characterizations of non-uniform complexity measures
Non-uniform complexity measures originated in automata and formal languages theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several computational models. It is shown to be closely related to context-free cost, boolean circuits, straight line programs, and Turing machines with sparse oracles and time or space bounds.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
