二进制字母表上理想语言的重置复杂度

{"title":"二进制字母表上理想语言的重置复杂度","authors":"M. Maslennikova","doi":"10.1007/978-3-319-60252-3_21","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Reset Complexity of Ideal Languages Over a Binary Alphabet\",\"authors\":\"M. Maslennikova\",\"doi\":\"10.1007/978-3-319-60252-3_21\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":305919,\"journal\":{\"name\":\"Workshop on Descriptional Complexity of Formal Systems\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Descriptional Complexity of Formal Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-60252-3_21\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Descriptional Complexity of Formal Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-60252-3_21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}