构建由-ω-正则表达式定义的-ω-词集合的最大前缀封闭子集

{"title":"构建由-ω-正则表达式定义的-ω-词集合的最大前缀封闭子集","authors":"A. Chebotarev","doi":"10.1007/s10559-023-00623-w","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":47101,"journal":{"name":"CYBERNETICS AND SYSTEMS ANALYSIS","volume":"58 1","pages":"880-889"},"PeriodicalIF":0.5000,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Constructing the Maximum Prefix-Closed Subset for a Set of –ω-Words Defined by a –ω-Regular Expression\",\"authors\":\"A. Chebotarev\",\"doi\":\"10.1007/s10559-023-00623-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":47101,\"journal\":{\"name\":\"CYBERNETICS AND SYSTEMS ANALYSIS\",\"volume\":\"58 1\",\"pages\":\"880-889\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CYBERNETICS AND SYSTEMS ANALYSIS\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s10559-023-00623-w\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CYBERNETICS AND SYSTEMS ANALYSIS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s10559-023-00623-w","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}