Weak MSO with the unbounding quantifier

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 3, Issue , 2009, Pages 159-170

  Bojanczyk, Mikolaj ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Automata; Monadic second order logic

Indexed keywords

AUTOMATA; DETERMINISTIC COUNTER AUTOMATA; EFFECTIVE TRANSLATION; INFINITE WORD; MONADIC SECOND-ORDER LOGIC; WEAK MONADIC SECOND-ORDER LOGIC;

COMPUTER SCIENCE; EQUIVALENCE CLASSES;

AUTOMATA THEORY;

EID: 84880231725     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. P. A. Abdulla, P. Krcál, and W. Yi. R-automata. In CONCUR, pages 67-81, 2008.
2. A. Arnold. A syntactic congruence for rational omega-language. Theor. Comput. Sci., 39:333-335, 1985.
3. M. Bojańczyk. A bounding quantifier. In Computer Science Logic, volume 3210 of Lecture Notes in Computer Science, pages 41-55, 2004.
4. M. Bojańczyk and T. Colcombet. Omega-regular expressions with bounds. In Logic in Computer Science, pages 285-296, 2006.
5. T. Colcombet and C. Löding. The nesting-depth of disjunctive mu-calculus for tree languages and the limitedness problem. In Computer Science Logic, volume 5213 of Lecture Notes in Computer Science, 2008.
6. T. Colcombet and C. Löding. The non-deterministic mostowski hierarchy and distance-parity automata. In International Colloquium on Automata, Languages and Programming, volume 5126 of Lecture Notes in Computer Science, pages 398-409, 2008.
7. M. Droste and P. Gastin. Weighted automata and weighted logics. Theor. Comput. Sci., 380(1-2):69-86, 2007.
8. K. Hashiguchi. Algorithms for determining relative star height and star height. Inf. Comput., 78(2):124-169, 1988.
9. A. S. Kechris. Classical Descriptive Set Theory, volume 156 of Graduate Texts in Mathematics. Springer, 1995.
10. D. Kirsten. Distance desert automata and the star height problem. Theoretical Informatics and Applications, 39(3):455-511, 2005.
11. M. P. Schützenberger. On the definition of a family of automata. Information and Control, 4:245-270, 1961.
12. I. Simon. Factorization forests of finite height. Theoretical Computer Science, 72:65-94, 1990.
13. W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Language Theory, volume III, pages 389-455. Springer, 1997.