Probabilistic Weighted Automata-Reference-Cited by-同舟云学术

Probabilistic Weighted Automata

Published:2009 Issue: Volume: Page:244-258
ISSN:0302-9743
Container-title:CONCUR 2009 - Concurrency Theory
language:
Short-container-title:

Author:

Chatterjee Krishnendu,Doyen Laurent,Henzinger Thomas A.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-04081-8_17

Reference25 articles.

1. Lecture Notes in Computer Science;C. Baier,2008

2. Baier, C., Größer, M.: Recognizing omega-regular languages with probabilistic automata. In: Proc. of LICS: Logic in Comp. Science, pp. 137–146. IEEE, Los Alamitos (2005)

3. Blondel, V.D., Canterini, V.: Undecidable problems for probabilistic automata of fixed dimension. Theory Comput. Syst. 36(3), 231–245 (2003)

4. Lecture Notes in Computer Science;A. Chakrabarti,2005

5. Lecture Notes in Computer Science;A. Chakrabarti,2003

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

1. Discounted-Sum Automata with Real-Valued Discount Factors;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. Describing Weighted Safety with Weighted LTL over Product omega-valuation Monoids;Scientific Annals of Computer Science;2023-12-20

3. On the Comparison of Discounted-Sum Automata with Multiple Discount Factors;Lecture Notes in Computer Science;2023

4. A Translation of Weighted LTL Formulas to Weighted Buchi Automata over omega-valuation Monoids;Scientific Annals of Computer Science;2021-12-20

5. Schema-agnostic SPARQL-driven faceted search benchmark generation;Journal of Web Semantics;2020-12