Power of Randomization in Automata on Infinite Strings-Reference-Cited by-同舟云学术

Power of Randomization in Automata on Infinite Strings

Published:2011-09-29 Issue:3 Volume:7 Page:
ISSN:1860-5974
Container-title:Logical Methods in Computer Science
language:en
Short-container-title:Log.Meth.Comput.Sci.

Author:

Chadha Rohit,Sistla A. Prasad,Viswanathan Mahesh

Publisher

Centre pour la Communication Scientifique Directe (CCSD)

Subject

General Computer Science,Theoretical Computer Science

Reference23 articles.

1. Defining liveness

2. C. Baier, N. Bertrand, and M. Größer. On decision problems for probabilistic Büchi automata. In11th International Conference on Foundations of Software Science and Computational Structures, FoSSaCS, pages 287-301, 2008.

3. C. Baier and M. Größer. Recognizingømega-regular languages with probabilistic automata. InProceedings of the IEEE Symposium on Logic in Computer Science, pages 137-146, 2005.

4. On the complexity of space bounded interactive proofs

5. R. Chadha, A. P. Sistla, and M. Viswanathan. On the expressiveness and complexity of randomization in finite state monitors. InLICS 2008- 23rd Annual IEEE Symposium on Logic in Computer Science, pages 18-29. IEEE Computer Society, 2008.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata;Lecture Notes in Computer Science;2020

2. Decidable and expressive classes of probabilistic automata;Journal of Computer and System Sciences;2019-03

3. The determinacy strength of pushdownω-languages;RAIRO - Theoretical Informatics and Applications;2017-01

4. Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata;Lecture Notes in Computer Science;2017

5. Deciding the value 1 problem for probabilistic leaktight automata;Logical Methods in Computer Science;2015-06-23