Logic and language models for computer science / Dana Richards and Henry Hamburger
Material type:
- 9780000988850
- 005.131 RIC-D
Item type | Current library | Collection | Shelving location | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|---|---|
![]() |
BITS Pilani Hyderabad | 003-007 | General Stack (For lending) | 005.131 RIC-D (Browse shelf(Opens below)) | Available | 45531 |
Browsing BITS Pilani Hyderabad shelves, Shelving location: General Stack (For lending), Collection: 003-007 Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
005.13 WIC-H Advanced R / | 005.131 LIN-P Introduction to formal languages and automata / | 005.131 NIE-H Semantics with applications : an appetizer / | 005.131 RIC-D Logic and language models for computer science / | 005.131 SRI-E Formal languages and automata theory / | 005.133 ACH-S Reimagining data visualization using Python / | 005.133 AGA-B Hands-on data structures and algorithms with python : store, manipulate, and access data effectively and boost the performance of your applications / |
This text presents the formal concepts underlying Computer Science. It starts with a comprehensive introduction to logic with an emphasis on reasoning and proof, with chapters on program verification and Prolog. The treatment of computability with automata and formal languages stands out in several ways. For example, it emphasises the algorithmic nature of the proofs and the reliance on simulations: it stresses the centrality of nondeterminism in generative models and the relationship to deterministic recognition models. The style is appropriate for both undergraduate and graduate classes.
There are no comments on this title.