Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata

Probabilistic Büchi automata are a natural generalization of PFA to infinite words, but have been studied in-depth only rather recently and many interesting questions are still open. PBA are known to accept, in general, a class of languages that goes beyond the regular languages. In this work we ext...

Descripción completa

Detalles Bibliográficos
Autores principales: Löding, Christof, Pirogov, Anton
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7788605/
http://dx.doi.org/10.1007/978-3-030-45231-5_27
_version_ 1783633062201917440
author Löding, Christof
Pirogov, Anton
author_facet Löding, Christof
Pirogov, Anton
author_sort Löding, Christof
collection PubMed
description Probabilistic Büchi automata are a natural generalization of PFA to infinite words, but have been studied in-depth only rather recently and many interesting questions are still open. PBA are known to accept, in general, a class of languages that goes beyond the regular languages. In this work we extend the known classes of restricted PBA which are still regular, strongly relying on notions concerning ambiguity in classical [Formula: see text] -automata. Furthermore, we investigate the expressivity of the not yet considered but natural class of weak PBA, and we also show that the regularity problem for weak PBA is undecidable.
format Online
Article
Text
id pubmed-7788605
institution National Center for Biotechnology Information
language English
publishDate 2020
record_format MEDLINE/PubMed
spelling pubmed-77886052021-01-07 Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata Löding, Christof Pirogov, Anton Foundations of Software Science and Computation Structures Article Probabilistic Büchi automata are a natural generalization of PFA to infinite words, but have been studied in-depth only rather recently and many interesting questions are still open. PBA are known to accept, in general, a class of languages that goes beyond the regular languages. In this work we extend the known classes of restricted PBA which are still regular, strongly relying on notions concerning ambiguity in classical [Formula: see text] -automata. Furthermore, we investigate the expressivity of the not yet considered but natural class of weak PBA, and we also show that the regularity problem for weak PBA is undecidable. 2020-04-17 /pmc/articles/PMC7788605/ http://dx.doi.org/10.1007/978-3-030-45231-5_27 Text en © The Author(s) 2020 Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made. The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
spellingShingle Article
Löding, Christof
Pirogov, Anton
Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata
title Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata
title_full Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata
title_fullStr Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata
title_full_unstemmed Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata
title_short Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata
title_sort ambiguity, weakness, and regularity in probabilistic büchi automata
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7788605/
http://dx.doi.org/10.1007/978-3-030-45231-5_27
work_keys_str_mv AT lodingchristof ambiguityweaknessandregularityinprobabilisticbuchiautomata
AT pirogovanton ambiguityweaknessandregularityinprobabilisticbuchiautomata

Ejemplares similares