A bounding quantifier

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

Volumn 3210, Issue , 2004, Pages 41-55

  Bojańczyk, Mikołaj ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; RECONFIGURABLE HARDWARE;

MONADIC SECOND-ORDER LOGIC; SATISFIABILITY;

COMPUTER CIRCUITS;

EID: 34547344281     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30124-0_7     Document Type: Article

References (12)

1. K. Barthelmann. When can an equational simple graph be generated by hyperedge replacement? In MFCS, volume 1450 of Lecture Notes in Computer Science, pages 543-552, 1998.
2. M. Bojańczyk. Two-way alternating automata and finite models. In International Colloquium on Automata, Languages and Programming, volume 2380 of Lecture Notes in Computer Science, pages 833-844, 2002.
3. M. Bojańczyk. The finite graph problem for two-way alternating automata. Theoretical Computer Science, 298(3):511-528, 2003.
4. A. Bouquet, O. Serre, and I. Walukiewicz. Pushdown games with unboundedness and regular conditions. In Foundations of Software Technology and Theoretical Computer Science, volume 2914 of Lecture Notes in Computer Science, pages 88-99, 2003.
5. O. Carton and W. Thomas. The monadic theory of morphic infinite words and generalizations. In Mathematical Foundations of Computer Science, volume 1893 of Lecture Notes in Computer Science, pages 275-284, 2000.
6. C. C. Elgot and M. O. Rabin. Decidability and undecidability of extensions of second (first) order theory of (generalized) successor. Journal of Symbolic Logic, 31:169-181, 1966.
7. F. Klaedtke and H. Ruess. Parikh automata and monadic second-order logics with linear cardinality constraints. Technical Report 177, Institute of Computer Science at Freiburg University, 2002.
8. D. Niwiński. On the cardinality of sets of infinite trees recognizable by infinite automata. In Mathematical Foundations of Computer Science, volume 520 of Lecture Notes in Computer Science, 1991.
9. M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the AMS, 141:1-23, 1969.
10. M. O. Rabin. Automata on Infinite Objects and Church's Problem. American Mathematical Society, Providence, RI, 1972.
11. F. P. Ramsey. On a problem of formal logic. Proceedings of the London Mathematical Society, 30:264-285, 1930.
12. M. Vardi. Reasoning about the past with two-way automata. In International Colloquium on Automata, Languages and Programming, number 1443 in Lecture Notes in Computer Science, pages 628-641, 1998.