Weak cost monadic logic over infinite trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6907 LNCS, Issue , 2011, Pages 580-591

  Vanden Boom, Michael ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDEDNESS PROPERTIES; DECISION PROCEDURE; EQUIVALENCE RELATIONS; FINITE SET; FINITE WORDS; INFINITE TREES; INFINITE TWO-PLAYER GAME; MONADIC LOGIC; MONADIC SECOND-ORDER LOGIC; SECOND ORDERS; WEAK FORM;

COMPUTER SCIENCE; FORMAL LOGIC; PLANT EXTRACTS; SET THEORY; TREES (MATHEMATICS);

COSTS;

EID: 80052131860     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22993-0_52     Document Type: Conference Paper

References (14)

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. Colcombet, T.: The theory of stabilisation monoids and regular cost functions. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 139-150. Springer, Heidelberg (2009)
5. Colcombet, T., Löding, C.: The nesting-depth of disjunctive mu-calculus. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 416-430. Springer, Heidelberg (2008)
6. Colcombet, T., Löding, C.: The non-deterministic Mostowski hierarchy and distance-parity automata. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 398-409. Springer, Heidelberg (2008)
7. Colcombet, T., Löding, C.: Regular cost functions over finite trees. In: LICS, pp. 70-79. IEEE Computer Society, Los Alamitos (2010)
8. Hashiguchi, K.: Relative star height, star height and finite automata with distance functions. In: Pin, J.E. (ed.) LITP 1988. LNCS, vol. 386, pp. 74-88. Springer, Heidelberg (1989)
9. Kirsten, D.: Distance desert automata and the star height problem. RAIRO - Theoretical Informatics and Applications 39(3), 455-509 (2005)
10. Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. International Journal of Algebra and Computation 4, 405-425 (1994)
11. Muller, D.E., Saoudi, A., Schupp, P.E.: Alternating automata. the weak monadic theory of the tree, and its complexity. In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 275-283. Springer, Heidelberg (1986)
12. Parigot, M.: Automata, games, and positive monadic theories of trees. In: Nori, K.V. (ed.) FSTTCS 1987. LNCS, vol. 287, pp. 44-57. Springer, Heidelberg (1987)
13. Rabin, M.O.: Weakly definable relations and special automata. In: Mathematical Logic and Foundations of Set Theory (Proc. Internat. Colloq., Jerusalem, 1968), pp. 1-23. North-Holland, Amsterdam (1970)
14. Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Beyond Words, vol. 3, pp. 389-455. Springer, Heidelberg (1997)