Nothing Special   »   [go: up one dir, main page]
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Formal Languages and Automata Theory

arXiv:0907.4760v1 (cs)
[Submitted on 28 Jul 2009]

Title:Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability

Authors:Christel Baier (Technische Universität Dresden), Nathalie Bertrand (INRIA Rennes), Marcus Größer (Technische Universität Dresden)
View PDF
Abstract: Probabilistic omega-automata are variants of nondeterministic automata for infinite words where all choices are resolved by probabilistic distributions. Acceptance of an infinite input word can be defined in different ways: by requiring that (i) the probability for the accepting runs is positive (probable semantics), or (ii) almost all runs are accepting (almost-sure semantics), or (iii) the probability measure of the accepting runs is greater than a certain threshold (threshold semantics). The underlying notion of an accepting run can be defined as for standard omega-automata by means of a Buechi condition or other acceptance conditions, e.g., Rabin or Streett conditions. In this paper, we put the main focus on the probable semantics and provide a summary of the fundamental properties of probabilistic omega-automata concerning expressiveness, efficiency, and decision problems.
Subjects: Formal Languages and Automata Theory (cs.FL)
ACM classes: F.4.3
Cite as: arXiv:0907.4760 [cs.FL]
  (or arXiv:0907.4760v1 [cs.FL] for this version)
  https://doi.org/10.48550/arXiv.0907.4760
Journal reference: EPTCS 3, 2009, pp. 3-16
Related DOI: https://doi.org/10.4204/EPTCS.3.1

Submission history

From: Giovanni Pighizzini [view email]
[v1] Tue, 28 Jul 2009 01:20:51 UTC (41 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.FL
< prev   |   next >
new | recent | 2009-07
Change to browse by:
cs

References & Citations

DBLP - CS Bibliography

listing | bibtex
Christel Baier
Nathalie Bertrand
Marcus Größer
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)