{"title":"亚零度自动机的正则空性问题","authors":"H. Michalewski, M. Mio, M. Bojanczyk","doi":"10.4204/EPTCS.223.1","DOIUrl":null,"url":null,"abstract":"Subzero automata is a class of tree automata whose acceptance condition can express probabilistic constraints. Our main result is that the problem of determining if a subzero automaton accepts some regular tree is decidable.","PeriodicalId":147821,"journal":{"name":"International Conference on Information and Computation Economies","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"On the Regular Emptiness Problem of Subzero Automata\",\"authors\":\"H. Michalewski, M. Mio, M. Bojanczyk\",\"doi\":\"10.4204/EPTCS.223.1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Subzero automata is a class of tree automata whose acceptance condition can express probabilistic constraints. Our main result is that the problem of determining if a subzero automaton accepts some regular tree is decidable.\",\"PeriodicalId\":147821,\"journal\":{\"name\":\"International Conference on Information and Computation Economies\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-08-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Information and Computation Economies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.223.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":"International Conference on Information and Computation Economies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.223.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the Regular Emptiness Problem of Subzero Automata
Subzero automata is a class of tree automata whose acceptance condition can express probabilistic constraints. Our main result is that the problem of determining if a subzero automaton accepts some regular tree is decidable.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
