Author:
Almagor Shaull,Boker Udi,Kupferman Orna
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Boker, U., Henzinger, T.A.: Determinizing discounted-sum automata. In: Proc. 20th Annual Conf. for Computer Science Logic (2011)
2. Chatterjee, K., Doyen, L., Henzinger, T.: Quantative languages. In: Proc. 17th Annual Conf. for Computer Science Logic, pp. 385–400 (2008)
3. Chatterjee, K., Doyen, L., Henzinger, T.A.: Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science 6(3) (2010)
4. Degorre, A., Doyen, L., Gentilini, R., Raskin, J., Torunczyk, S.: Energy and mean-payoff games with imperfect information. In: Proc. 19th Annual Conf. for Computer Science Logic, pp. 260–274 (2010)
5. Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. Springer, Heidelberg (2009)
Cited by
59 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. On some decidability questions concerning supports of rational series;Information Processing Letters;2023-01
3. Comparator automata in quantitative verification;Logical Methods in Computer Science;2022-07-29
4. The Big-O Problem;Logical Methods in Computer Science;2022-03-15
5. Weight Annotation in Information Extraction;Logical Methods in Computer Science;2022-01-31