{"title":"双相似概率自动机的点阵结构","authors":"Johann Schuster, M. Siegle","doi":"10.4204/EPTCS.140.1","DOIUrl":null,"url":null,"abstract":"The paper shows that there is a deep structure on certain sets of bisimilar Probabilistic Automata (PA). The key prerequisite for these structures is a notion of compactness of PA. It is shown that compact bisimilar PA form lattices. These results are then used in order to establish normal forms not only for finite automata, but also for infinite automata, as long as they are compact.","PeriodicalId":31175,"journal":{"name":"Infinity","volume":"130 1","pages":"1-15"},"PeriodicalIF":0.0000,"publicationDate":"2014-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Lattice structures for bisimilar Probabilistic Automata\",\"authors\":\"Johann Schuster, M. Siegle\",\"doi\":\"10.4204/EPTCS.140.1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper shows that there is a deep structure on certain sets of bisimilar Probabilistic Automata (PA). The key prerequisite for these structures is a notion of compactness of PA. It is shown that compact bisimilar PA form lattices. These results are then used in order to establish normal forms not only for finite automata, but also for infinite automata, as long as they are compact.\",\"PeriodicalId\":31175,\"journal\":{\"name\":\"Infinity\",\"volume\":\"130 1\",\"pages\":\"1-15\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-02-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Infinity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.140.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":"Infinity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.140.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Lattice structures for bisimilar Probabilistic Automata
The paper shows that there is a deep structure on certain sets of bisimilar Probabilistic Automata (PA). The key prerequisite for these structures is a notion of compactness of PA. It is shown that compact bisimilar PA form lattices. These results are then used in order to establish normal forms not only for finite automata, but also for infinite automata, as long as they are compact.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
