
000 | 01049camuu22003014a 4500 | |
001 | 000045133732 | |
005 | 20041125140230 | |
008 | 021209s2002 gw a b 001 0 eng | |
010 | ▼a 2002044587 | |
020 | ▼a 3540003886 (alk. paper) | |
040 | ▼a DLC ▼c DLC ▼d DLC ▼d 211009 | |
042 | ▼a pcc | |
050 | 0 0 | ▼a QA76.9.M35 ▼b A85 2002 |
082 | 0 0 | ▼a 004/.01/51 ▼2 21 |
090 | ▼a 004.0151 ▼b A939 | |
245 | 0 0 | ▼a Automata, logics, and infinite games / ▼c Erich Gra@del, Wolfgang Thomas, Thomas Wilke (eds.). |
260 | ▼a Berlin ; ▼a New York : ▼b Springer , ▼c 2002. | |
300 | ▼a viii, 385 p. : ▼b ill. ; ▼c 24 cm. | |
440 | 0 | ▼a Lecture notes in computer science ; ▼v 2500 |
504 | ▼a Includes bibliographical references (p. [365]-376) and index. | |
650 | 0 0 | ▼a Computer science ▼x Mathematics. |
650 | 0 0 | ▼a Machine theory. |
650 | 0 | ▼a Logic, Symbolic and mathematical. |
650 | 0 | ▼a Game theory. |
700 | 1 | ▼a Gra@del, Erich ▼d 1958- |
700 | 1 | ▼a Thomas, Wolfgang ▼d 1947- |
700 | 1 | ▼a Wilke, Thomas ▼d 1965- |
소장정보
No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
---|---|---|---|---|---|---|---|
No. 1 | 소장처 과학도서관/Sci-Info(2층서고)/ | 청구기호 004.0151 A939 | 등록번호 121100902 | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
컨텐츠정보
목차
?-Automata.- Infinite Games.- Determinization and Complementation.- Determinization of Buchi-Automata.- Complementation of Buchi Automata Using Alternation.- Determinization and Complementation of Streett Automata.- Parity Games.- Memoryless Determinacy of Parity Games.- Algorithms for Parity Games.- Tree Automata.- Nondeterministic Tree Automata.- Alternating Tree Automata and Parity Games.- Modal ?-Calculus.- Modal ?-Calculus and Alternating Tree Automata.- Strictness of the Modal ?-Calculus Hierarchy.- Monadic Second-Order Logic.- Decidability of S1S and S2S.- The Complexity of Translating Logic to Finite Automata.- Expressive Power of Monadic Second-Order Logic and Modal ?-Calculus.- Tree-like Models.- Prefix-Recognizable Graphs and Monadic Logic.- The Monadic Theory of Tree-like Structures.- Two-Way Tree Automata Solving Pushdown Games.- Guarded Logics.- to Guarded Logics.- Automata for Guarded Fixed Point Logics.- Appendices.- Some Fixed Point Basics.
정보제공 :
