{"title":"正则表达式矩阵kleene闭包的一种高效算法","authors":"Edward T. Lee","doi":"10.1007/BF00996818","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":250718,"journal":{"name":"International Journal of Computer & Information Sciences","volume":"167 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1982-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An efficient algorithm for finding kleene closure of regular expression matrices\",\"authors\":\"Edward T. Lee\",\"doi\":\"10.1007/BF00996818\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":250718,\"journal\":{\"name\":\"International Journal of Computer & Information Sciences\",\"volume\":\"167 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1982-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computer & Information Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/BF00996818\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer & Information Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/BF00996818","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}