M. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1--35, 1969. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Regular Vacuity - Doron Bustan Alon (Correct)
No context found.
M. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1--35, 1969.
Automata-Theoretic Techniques for Temporal Reasoning - Vardi (2006) (Correct)
No context found.
M.O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1--35, 1969.
Modal Logics with Existential Modality, Finite-iteration.. - Shkatov (2005) (Correct)
No context found.
M. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1--35, 1969.
Weak Muller Acceptance Conditions for Tree Automata - Torre, Murano, Napoli (Correct)
No context found.
M.O. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc., 141:1 -- 35, 1969.
Automata-theoretic Decision of Timed Games - Marco Faella Salvatore (2002) (Correct)
No context found.
M.O. Rabin. Decidability of second-order theories and automata on in nite trees. Trans. Amer. Math. Soc., 141:1 - 35, 1969.
Safraless Decision Procedures - Orna Kupferman Hebrew (Correct)
No context found.
M.O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1--35, 1969.
Relating Word and Tree Automata - Orna Kupferman Bell (1996) (3 citations) (Correct)
No context found.
M.O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1--35, 1969.
On Relational Analysis of Algebraic Datatypes - Kuncak, Jackson (Correct)
No context found.
M. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc., 141:1--35, 1969.
On the Model Checking Problem for Branching Time Logics - And Basic Parallel (Correct)
No context found.
M.O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society 141:1--35, 1969.
More Infinite Results - Burkart, Esparza (1997) (6 citations) (Correct)
No context found.
R.O. Rabin. Decidability of Second-Order Theories and Automata on Infinite Trees. Transactions of the AMS, 141:1--35, 1969.
The Boundary between Decidability and.. - Immerman.. (2004) (6 citations) (Correct)
No context found.
M. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc., 141:1--35, 1969.
A Bounding Quantifier - Bojanczyk (2004) (Correct)
No context found.
M. O. Rabin. Decidability of second-order theories and automata on in nite trees. Transactions of the AMS, 141:123, 1969.
Relating Word and Tree Automata - Kupferman, Safra, Vardi (2004) (3 citations) (Correct)
No context found.
M.O. Rabin. Decidability of second order theories and automata on in nite trees. Transaction of the AMS, 141:1-35, 1969.
Verification Via Structure Simulation - Immerman, Rabinovich, Reps.. (2004) (1 citation) (Correct)
No context found.
M. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc., 141:1--35, 1969.
TEMPORAL LOGICS OF COMPUTATIONS - Introductory course - Goranko (2000) (Correct)
No context found.
M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1--35, 1969.
The Book Review Column - William Gasarch Department (Correct)
No context found.
M. O. Rabin. Decidability of second-order theories and automata on in nite trees. Trans. of Amer. Math. Soc., 141:1-35, 1969.
Exploration of the Syntactical Modeling Capabilities in.. - Paez, Ruiz (1996) (Correct)
No context found.
Rabin, MO., Decidability of seco nd-order theories and automata on infinite trees, Trans. American Mathematical Society, 141:1-35, 1969.
Removing Redundant Arguments Automatically - M.Alpuente, S.Escobar, S.Lucas (2004) (Correct)
No context found.
Rabin, M. O. 1969. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society 141, 1--35. 34
Subtype Constraints in Modal Logic - Niehren, Priesnitz (2005) (Correct)
No context found.
M. O. Rabin. Decidability of second-order theories and automata on infinte trees. Trans. Amer. Math. Soc. , 141:1--35, 1969.
The Complexity of Temporal Logic Model Checking - Schnoebelen (2003) (2 citations) (Correct)
No context found.
M. O. Rabin. Decidability of second-order theories and automata on in nite trees. Trans. Amer. Math. Soc., 141:1-35, 1969.
An Infinite Hierarchy of Temporal Logics over Branching Time - Rabinovich, Maoz (Correct)
No context found.
M. O. Rabin (1969). Decidability of second order theories and automata on infinite trees. In Trans. Amer. Math. Soc.,141,pp 1-35.
Future Temporal Logic Needs in Finitely Many Modalities - Hirshfeld, Rabinovich (2003) (Correct)
No context found.
M. O. Rabin (1969). Decidability of second order theories and automata on in nite trees. In Trans. Amer. Math. Soc.,141,pp 1-35.
Modal Logics of Ordered Trees: A Summary - Endriss (2003) (Correct)
No context found.
M. O. Rabin. Decidability of Second-Order Theories and Automata on Infinite Trees. Transactions of the AMS, 141:1--35, 1969.
On Translating Linear Temporal Logic into Alternating and.. - Tauriainen (2003) (3 citations) (Correct)
No context found.
M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1-- 35, 1969.
BTL2 and expressive completeness for ECTL+ - Rabinovich, Schnoebelen (2000) (Correct)
No context found.
M. O. Rabin. Decidability of second-order theories and automata on in nite trees. Trans. Amer. Math. Soc., 141:1-35, 1969.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC