C. Baier, N. Bertrand, M. Grosser. Probabilistic Acceptors for Languages over Infinite Words. In 35th Conference on Current Trends in Theory and Practice of Computer Science, LNCS, Volume 5404, Pages 19-33, Spindleruv Mlyn, Czech, 2009.
Download paper:
Doi page
Download paper:
Adobe portable document (pdf) 
Copyright notice:
This material is presented to ensure timely dissemination of scholarly and
technical work. Copyright and all rights therein are retained by authors or
by other copyright holders. All persons copying this information are expected
to adhere to the terms and constraints invoked by each author's
copyright. These works may not be reposted without the explicit permission of
the copyright holder.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic
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 requires that the probability for the accepting runs is positive. In this paper, we provide a summary of the fundamental properties of probabilistic omega-automata concerning expressiveness, efficiency, compositionality and decision problems
Nathalie Bertrand http://www.irisa.fr/prive/nbertran/
@InProceedings{BaierBG09,
Author = {Baier, C. and Bertrand, N. and Grosser, M.},
Title = {Probabilistic Acceptors for Languages over Infinite Words},
BookTitle = {35th Conference on Current Trends in Theory and Practice of Computer Science},
Volume = { 5404},
Pages = {19--33},
Series = {LNCS},
Address = {Spindleruv Mlyn, Czech},
Year = {2009}
}
Get EndNote Reference (.ref)
|
| VerTeCs
| Team
| Publications
| New Results
| Softwares
|
Irisa - Inria - Copyright 2005 © Projet VerTeCs |