關於本電子書
This book presents what in our opinion constitutes the basis of the theory of the mu-calculus, considered as an algebraic system rather than a logic. We have wished to present the subject in a unified way, and in a form as general as possible. Therefore, our emphasis is on the generality of the fixed-point notation, and on the connections between mu-calculus, games, and automata, which we also explain in an algebraic way. This book should be accessible for graduate or advanced undergraduate students both in mathematics and computer science. We have designed this book especially for researchers and students interested in logic in computer science, comuter aided verification, and general aspects of automata theory. We have aimed at gathering in a single place the fundamental results of the theory, that are currently very scattered in the literature, and often hardly accessible for interested readers. The presentation is self-contained, except for the proof of the Mc-Naughton's Determinization Theorem (see, e.g., [97]. However, we suppose that the reader is already familiar with some basic automata theory and universal algebra. The references, credits, and suggestions for further reading are given at the end of each chapter.
為這本電子書評分
歡迎提供意見。
閱讀資訊
智慧型手機與平板電腦
筆記型電腦和電腦
你可以使用電腦的網路瀏覽器聆聽你在 Google Play 購買的有聲書。
電子書閱讀器與其他裝置
如要在 Kobo 電子閱讀器這類電子書裝置上閱覽書籍，必須將檔案下載並傳輸到該裝置上。請按照說明中心的詳細操作說明，將檔案傳輸到支援的電子閱讀器上。
