Gift Siromoney, R. Siromoney, K. Subramanian, V. Dare, P. Abisha
{"title":"Generalized Parikh Vector and Public Key Cryptosystems","authors":"Gift Siromoney, R. Siromoney, K. Subramanian, V. Dare, P. Abisha","doi":"10.1142/9789814368452_0018","DOIUrl":"https://doi.org/10.1142/9789814368452_0018","url":null,"abstract":"","PeriodicalId":347958,"journal":{"name":"A Perspective in Theoretical Computer Science","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115383680","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":"Cryptosystems for Tamil","authors":"R. Siromoney, M. Chandrasekaran, A. Huq","doi":"10.1142/9789814368452_0020","DOIUrl":"https://doi.org/10.1142/9789814368452_0020","url":null,"abstract":"","PeriodicalId":347958,"journal":{"name":"A Perspective in Theoretical Computer Science","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123770325","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":"Clans and the Complexity of Dependence graphs","authors":"A. Ehrenfeucht, G. Rozenberg","doi":"10.1142/9789814368452_0003","DOIUrl":"https://doi.org/10.1142/9789814368452_0003","url":null,"abstract":"","PeriodicalId":347958,"journal":{"name":"A Perspective in Theoretical Computer Science","volume":"504 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133053391","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":"Map Systems with handles","authors":"Gift Siromoney, K. Subramanian, R. Siromoney","doi":"10.1142/9789814368452_0019","DOIUrl":"https://doi.org/10.1142/9789814368452_0019","url":null,"abstract":"","PeriodicalId":347958,"journal":{"name":"A Perspective in Theoretical Computer Science","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117311962","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":"Complexity of Acceptance Problems for Two-Dimensional Automata","authors":"A. Ito, Katsushi Inoue, I. Takanami","doi":"10.1142/9789814368452_0005","DOIUrl":"https://doi.org/10.1142/9789814368452_0005","url":null,"abstract":"","PeriodicalId":347958,"journal":{"name":"A Perspective in Theoretical Computer Science","volume":"344 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116238294","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}
P. Prusinkiewicz, K. Krithivasan, M. G. Vijaynarayana
{"title":"Application of L-Systems to Algorithmic Generation of South Indian Folk Art Patterns and Karnatic Music","authors":"P. Prusinkiewicz, K. Krithivasan, M. G. Vijaynarayana","doi":"10.1142/9789814368452_0014","DOIUrl":"https://doi.org/10.1142/9789814368452_0014","url":null,"abstract":"","PeriodicalId":347958,"journal":{"name":"A Perspective in Theoretical Computer Science","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122106477","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":"The Constructive Engine","authors":"G. Huet","doi":"10.1142/9789814368452_0004","DOIUrl":"https://doi.org/10.1142/9789814368452_0004","url":null,"abstract":"The Calculus of Constructions is a higher-order formalism for writing constructive proofs in a natural deduction style, inspired from work of de Bruijn [4, 7], Girard [21] and MartinLof [33]. The calculus and its syntactic theory were presented in Coquand’s thesis [12], and an implementation by the author was used to mechanically verify a substantial number of proofs demonstrating the power of expression of the formalism [15]. The Calculus of Constructions is proposed as a foundation for the design of programming environments where programs are developed consistently with formal specifications[37]. This note presents in detail an implementation in CAML[18, 44] of a proof-checker for the calculus. This proof-checker proceeds by operating an abstract machine, called the constructive engine. The description in this paper is close in spirit to the inference system described in section 10.2 of [13]. The main departure is the addition of a system of constants, allowing a form of definitional equality. The implementation shown corresponds to a simplification of version 4.9 of the system. Differences with the actual implementation are discussed below.","PeriodicalId":347958,"journal":{"name":"A Perspective in Theoretical Computer Science","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115390953","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号
