Author:
Fijalkow Nathanaël,Gimbert Hugo,Kelmendi Edon,Oualhadj Youssouf
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete);2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
2. Probabilistic automata of bounded ambiguity;Information and Computation;2022-01
3. A Probabilistic Higher-order Fixpoint Logic;Logical Methods in Computer Science;2021-12-02
4. When are emptiness and containment decidable for probabilistic automata?;Journal of Computer and System Sciences;2021-08
5. Alternating Tree Automata with Qualitative Semantics;ACM Transactions on Computational Logic;2021-01-22