{"title":"带有计数器的流程图示意图","authors":"D. Plaisted","doi":"10.1145/800152.804895","DOIUrl":null,"url":null,"abstract":"The translation of a specific flowchart schema with one counter into an equivalent flowchart schema without counters is described. This result leads easily to the general translation method from one-counter flowchart schemata to zero-counter flowchart schemata. Some generalizations are then presented.","PeriodicalId":229726,"journal":{"name":"Proceedings of the fourth annual ACM symposium on Theory of computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1972-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Flowchart schemata with counters\",\"authors\":\"D. Plaisted\",\"doi\":\"10.1145/800152.804895\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The translation of a specific flowchart schema with one counter into an equivalent flowchart schema without counters is described. This result leads easily to the general translation method from one-counter flowchart schemata to zero-counter flowchart schemata. Some generalizations are then presented.\",\"PeriodicalId\":229726,\"journal\":{\"name\":\"Proceedings of the fourth annual ACM symposium on Theory of computing\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1972-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the fourth annual ACM symposium on Theory of computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800152.804895\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the fourth annual ACM symposium on Theory of computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800152.804895","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The translation of a specific flowchart schema with one counter into an equivalent flowchart schema without counters is described. This result leads easily to the general translation method from one-counter flowchart schemata to zero-counter flowchart schemata. Some generalizations are then presented.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
