无限字母上语言反转的闭包

{"title":"无限字母上语言反转的闭包","authors":"Daniel Genkin, M. Kaminski, L. Peterfreund","doi":"10.1007/978-3-319-90530-3_13","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Closure Under Reversal of Languages over Infinite Alphabets\",\"authors\":\"Daniel Genkin, M. Kaminski, L. Peterfreund\",\"doi\":\"10.1007/978-3-319-90530-3_13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":319321,\"journal\":{\"name\":\"Computer Science Symposium in Russia\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Science Symposium in Russia\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-90530-3_13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Science Symposium in Russia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-90530-3_13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}