{"title":"Computability Using Lambdas","authors":"Ganesh Gopalakrishnan","doi":"10.1201/9781315148175-21","DOIUrl":"https://doi.org/10.1201/9781315148175-21","url":null,"abstract":"","PeriodicalId":139478,"journal":{"name":"Automata and Computability","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128956567","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Basics of DFA","authors":"Ganesh Gopalakrishnan","doi":"10.1201/9781315148175-6","DOIUrl":"https://doi.org/10.1201/9781315148175-6","url":null,"abstract":"","PeriodicalId":139478,"journal":{"name":"Automata and Computability","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132099406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Regular Expressions and NFA","authors":"Ganesh Gopalakrishnan","doi":"10.1201/9781315148175-10","DOIUrl":"https://doi.org/10.1201/9781315148175-10","url":null,"abstract":"","PeriodicalId":139478,"journal":{"name":"Automata and Computability","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116989181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Post Correspondence, and Other Undecidability Proofs","authors":"Ganesh Gopalakrishnan","doi":"10.1201/9781315148175-18","DOIUrl":"https://doi.org/10.1201/9781315148175-18","url":null,"abstract":"","PeriodicalId":139478,"journal":{"name":"Automata and Computability","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126423401","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"NP-Completeness","authors":"Ganesh Gopalakrishnan","doi":"10.1201/9781315148175-19","DOIUrl":"https://doi.org/10.1201/9781315148175-19","url":null,"abstract":"Why study problems in NP? Papadimitriou and Steiglitz, page 351: “The recognition versions of all reasonable combinatorial optimization problems are in NP , . . . (because) . . . combinatorial optimization problems aim for the optimal design of objects. It is reasonable to expect that, once found, the optimal solution can be written down concisely, and thus serve as a certificate for the recognition version.”","PeriodicalId":139478,"journal":{"name":"Automata and Computability","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116109810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Context-Free Languages and Grammars","authors":"Ganesh Gopalakrishnan","doi":"10.1201/9781315148175-13","DOIUrl":"https://doi.org/10.1201/9781315148175-13","url":null,"abstract":"","PeriodicalId":139478,"journal":{"name":"Automata and Computability","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131808438","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
求助内容：
应助结果提醒方式：