{"title":"完全可达自动机","authors":"E. A. Bondar, Mikhail Volkov","doi":"10.1007/978-3-319-41114-9_1","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"6 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"Completely Reachable Automata\",\"authors\":\"E. A. Bondar, Mikhail Volkov\",\"doi\":\"10.1007/978-3-319-41114-9_1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":305919,\"journal\":{\"name\":\"Workshop on Descriptional Complexity of Formal Systems\",\"volume\":\"6 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"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-41114-9_1\",\"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-41114-9_1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}