{"title":"一种无上下文语言的生产者/消费者Petri网与无界缓冲区","authors":"V. Mukhin, Vitalii Statkevych","doi":"10.1109/DAS49615.2020.9108948","DOIUrl":null,"url":null,"abstract":"We consider the producer/consumer Petri net and the context-free formal language that it generates. Nonregularity of the language is proved, the corresponding pushdown automaton and context-free grammar are obtained. The connection with the Dyck formal language is pointed out.","PeriodicalId":103267,"journal":{"name":"2020 International Conference on Development and Application Systems (DAS)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On one context-free language for producer/consumer Petri net with the unbounded buffer\",\"authors\":\"V. Mukhin, Vitalii Statkevych\",\"doi\":\"10.1109/DAS49615.2020.9108948\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the producer/consumer Petri net and the context-free formal language that it generates. Nonregularity of the language is proved, the corresponding pushdown automaton and context-free grammar are obtained. The connection with the Dyck formal language is pointed out.\",\"PeriodicalId\":103267,\"journal\":{\"name\":\"2020 International Conference on Development and Application Systems (DAS)\",\"volume\":\"71 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on Development and Application Systems (DAS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DAS49615.2020.9108948\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Development and Application Systems (DAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAS49615.2020.9108948","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On one context-free language for producer/consumer Petri net with the unbounded buffer
We consider the producer/consumer Petri net and the context-free formal language that it generates. Nonregularity of the language is proved, the corresponding pushdown automaton and context-free grammar are obtained. The connection with the Dyck formal language is pointed out.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
