{"citation":{"ieee":"K. Chatterjee, Probabilistic automata on infinite words: Decidability and undecidability results. IST Austria, 2009.","short":"K. Chatterjee, Probabilistic Automata on Infinite Words: Decidability and Undecidability Results, IST Austria, 2009.","apa":"Chatterjee, K. (2009). Probabilistic automata on infinite words: Decidability and undecidability results. IST Austria. https://doi.org/10.15479/AT:IST-2009-0004","ama":"Chatterjee K. Probabilistic Automata on Infinite Words: Decidability and Undecidability Results. IST Austria; 2009. doi:10.15479/AT:IST-2009-0004","mla":"Chatterjee, Krishnendu. Probabilistic Automata on Infinite Words: Decidability and Undecidability Results. IST Austria, 2009, doi:10.15479/AT:IST-2009-0004.","ista":"Chatterjee K. 2009. Probabilistic automata on infinite words: Decidability and undecidability results, IST Austria, 17p.","chicago":"Chatterjee, Krishnendu. Probabilistic Automata on Infinite Words: Decidability and Undecidability Results. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0004."},"date_updated":"2023-02-23T11:45:44Z","ddc":["005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"}],"title":"Probabilistic automata on infinite words: Decidability and undecidability results","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:43Z","_id":"5392","type":"technical_report","status":"public","pubrep_id":"28","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"year":"2009","publication_status":"published","day":"02","file":[{"file_name":"IST-2009-0004_IST-2009-0004.pdf","date_created":"2018-12-12T11:54:08Z","creator":"system","file_size":311065,"date_updated":"2020-07-14T12:46:43Z","checksum":"fb7563150231325b00b1718d956f687b","file_id":"5530","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"page":"17","doi":"10.15479/AT:IST-2009-0004","related_material":{"record":[{"id":"3857","status":"public","relation":"later_version"}]},"date_published":"2009-11-02T00:00:00Z","date_created":"2018-12-12T11:39:04Z","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_version":"Published Version","alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","oa":1,"month":"11"}