{"title":"计算的形式模型-计算的极限","authors":"A. Fleck","doi":"10.1142/4592","DOIUrl":null,"url":null,"abstract":"Part 1 The finite state paradigm: regular expressions and acceptors properties of regular languages transducers and other variations. Part 2 Context-free grammars and automata: basic grammar definitions pushdown store automata properties of context-free languages. Part 3 General computability models: context-sensitive languages Turing machines and computability the universal machine and impossible computations.","PeriodicalId":440882,"journal":{"name":"AMAST Series in Computing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Formal Models of Computation - The Ultimate Limits of Computing\",\"authors\":\"A. Fleck\",\"doi\":\"10.1142/4592\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Part 1 The finite state paradigm: regular expressions and acceptors properties of regular languages transducers and other variations. Part 2 Context-free grammars and automata: basic grammar definitions pushdown store automata properties of context-free languages. Part 3 General computability models: context-sensitive languages Turing machines and computability the universal machine and impossible computations.\",\"PeriodicalId\":440882,\"journal\":{\"name\":\"AMAST Series in Computing\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AMAST Series in Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/4592\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AMAST Series in Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/4592","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Formal Models of Computation - The Ultimate Limits of Computing
Part 1 The finite state paradigm: regular expressions and acceptors properties of regular languages transducers and other variations. Part 2 Context-free grammars and automata: basic grammar definitions pushdown store automata properties of context-free languages. Part 3 General computability models: context-sensitive languages Turing machines and computability the universal machine and impossible computations.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
