Weak MSO with the Unbounding Quantifier

Theory of Computing Systems

Volumn 48, Issue 3, 2011, Pages 554-576

  Bojańczyk, Mikołaj ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Automata; Monadic second order logic

Indexed keywords

EID: 79751535579     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-010-9279-2     Document Type: Article

References (16)

1. Abdulla, P. A., Krcál, P., Yi, W.: R-automata. In: CONCUR, pp. 67-81 (2008).
2. Arnold, A.: A syntactic congruence for rational omega-language. Theor. Comput. Sci. 39, 333-335 (1985).
3. Bojańczyk, M.: A bounding quantifier. In: Computer Science Logic. Lecture Notes in Computer Science, vol. 3210, pp. 41-55. Springer, Berlin (2004).
4. Bojańczyk, M., Colcombet, T.: Omega-regular expressions with bounds. In: Logic in Computer Science, pp. 285-296 (2006).
5. Bojańczyk, M., Toruńczyk, S.: Deterministic automata and extensions of weak MSO. Submitted.
6. Colcombet, T.: Factorization forests for infinite words and applications to countable scattered linear orderings. Theor. Comput. Sci. 411(4-5), 751-764 (2010). doi: 10. 1016/j. tcs. 2009. 10. 013, DBLP, http://dblp. uni-trier. de.
7. Colcombet, T., Löding, C.: The nesting-depth of disjunctive mu-calculus for tree languages and the limitedness problem. In: Computer Science Logic. Lecture Notes in Computer Science, vol. 5213. Springer, Berlin (2008).
8. Colcombet, T., Löding, C.: The non-deterministic Mostowski hierarchy and distance-parity automata. In: International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 5126, pp. 398-409. Springer, Berlin (2008).
9. Droste, M., Gastin, P.: Weighted automata and weighted logics. Theor. Comput. Sci. 380(1-2), 69-86 (2007).
10. Hashiguchi, K.: Algorithms for determining relative star height and star height. Inf. Comput. 78(2), 124-169 (1988).
11. Kechris, A. S.: Classical Descriptive Set Theory. Graduate Texts in Mathematics, vol. 156. Springer, Berlin (1995).
12. Kirsten, D.: Distance desert automata and the star height problem. Theor. Inform. Appl. 39(3), 455-511 (2005).
13. Perrin, D., Pin, J.-É.: Infinite Words. Elsevier, Amsterdam (2004).
14. Schützenberger, M. P.: On the definition of a family of automata. Inf. Control 4, 245-270 (1961).
15. Siefkes, D.: The recursive sets in certain monadic second order fragments of arithmetic. Arch. Math. Log. Grundlagenforschung 17, 71-80 (1975).
16. Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Language Theory, vol. III, pp. 389-455. Springer, Berlin (1997).