{"month":"11","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"}],"date_updated":"2023-02-23T11:45:44Z","doi":"10.15479/AT:IST-2009-0004","title":"Probabilistic automata on infinite words: Decidability and undecidability results","_id":"5392","alternative_title":["IST Austria Technical Report"],"citation":{"chicago":"Chatterjee, Krishnendu. <i>Probabilistic Automata on Infinite Words: Decidability and Undecidability Results</i>. IST Austria, 2009. <a href=\"https://doi.org/10.15479/AT:IST-2009-0004\">https://doi.org/10.15479/AT:IST-2009-0004</a>.","apa":"Chatterjee, K. (2009). <i>Probabilistic automata on infinite words: Decidability and undecidability results</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2009-0004\">https://doi.org/10.15479/AT:IST-2009-0004</a>","ama":"Chatterjee K. <i>Probabilistic Automata on Infinite Words: Decidability and Undecidability Results</i>. IST Austria; 2009. doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0004\">10.15479/AT:IST-2009-0004</a>","ieee":"K. Chatterjee, <i>Probabilistic automata on infinite words: Decidability and undecidability results</i>. IST Austria, 2009.","ista":"Chatterjee K. 2009. Probabilistic automata on infinite words: Decidability and undecidability results, IST Austria, 17p.","short":"K. Chatterjee, Probabilistic Automata on Infinite Words: Decidability and Undecidability Results, IST Austria, 2009.","mla":"Chatterjee, Krishnendu. <i>Probabilistic Automata on Infinite Words: Decidability and Undecidability Results</i>. IST Austria, 2009, doi:<a href=\"https://doi.org/10.15479/AT:IST-2009-0004\">10.15479/AT:IST-2009-0004</a>."},"type":"technical_report","date_published":"2009-11-02T00:00:00Z","day":"02","date_created":"2018-12-12T11:39:04Z","publication_status":"published","has_accepted_license":"1","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"17","oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:43Z","file":[{"date_updated":"2020-07-14T12:46:43Z","file_size":311065,"content_type":"application/pdf","creator":"system","checksum":"fb7563150231325b00b1718d956f687b","file_id":"5530","date_created":"2018-12-12T11:54:08Z","relation":"main_file","access_level":"open_access","file_name":"IST-2009-0004_IST-2009-0004.pdf"}],"department":[{"_id":"KrCh"}],"abstract":[{"lang":"eng","text":"We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs of [GO09] and present a precise characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems."}],"oa":1,"year":"2009","ddc":["005"],"publication_identifier":{"issn":["2664-1690"]},"related_material":{"record":[{"status":"public","relation":"later_version","id":"3857"}]},"language":[{"iso":"eng"}],"pubrep_id":"28","publisher":"IST Austria"}