Weak Cost Monadic Logic over Infinite Trees-Reference-Cited by-同舟云学术

Weak Cost Monadic Logic over Infinite Trees

Published:2011 Issue: Volume: Page:580-591
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 2011
language:
Short-container-title:

Author:

Vanden Boom Michael

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-22993-0_52

Reference14 articles.

1. Bojanczyk, M.: Weak MSO with the unbounding quantifier. In: Albers, S., Marion, J.Y. (eds.) STACS. LIPIcs, vol. 3, pp. 159–170. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2009)

2. Bojanczyk, M., Colcombet, T.: Bounds in ω-regularity. In: LICS, pp. 285–296. IEEE Computer Society, Los Alamitos (2006)

3. Colcombet, T.: Regular cost functions over words (2009), manuscript online

4. Lecture Notes in Computer Science;T. Colcombet,2009

5. Lecture Notes in Computer Science;T. Colcombet,2008

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

1. Cost Automata, Safe Schemes, and Downward Closures;Fundamenta Informaticae;2023-04-07

2. Index Problems for Game Automata;ACM Transactions on Computational Logic;2016-11-15

3. Parameterized linear temporal logics meet costs: still not costlier than LTL;Acta Informatica;2016-10-13

4. Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings;Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science;2016-07-05

5. Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL;Electronic Proceedings in Theoretical Computer Science;2015-09-23