[DOWNLOAD] ~ Logic and Language Models for Computer Science by Dana Richards & Henry Hamburger ~ eBook PDF Kindle ePub Free
eBook details
- Title: Logic and Language Models for Computer Science
- Author : Dana Richards & Henry Hamburger
- Release Date : January 08, 2017
- Genre: Computers & Internet,Books,Programming,Computers,
- Pages : * pages
- Size : 15931 KB
Description
This text presents the formal concepts underlying Computer Science.
It starts with a wide 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:
it emphasizes 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.
Contents: Mathematical PreliminariesLogic for Computer Science:Propositional LogicProofs by DeductionPredicate LogicProving with PredicatesProgram VerificationLanguage Models for Computer Science:Language and ModelsGenerative Models of Regular LanguagesFinite Automata and Regular LanguagesContext-Free GrammarsPushdown Automata and ParsingTuring MachinesAppendices:Logic ProgrammingThe awk LanguageAnswers to Selected Problems
Readership: Students and professionals interested in theoretical computation and language models for computer science.
Keywords:Theory of Computation;Logic Automata Theory;Formal LanguagesReview:Key Features:The emphasis is on Logic. Logic is described in the context of reasoning (not circuits) with a concentration on proof techniques. The discussion entails a chapter on Program Verification and a chapter on Prolog programmingThere is a forthright treatment of non-determinism. Non-determinism is fundamental to generative techniques, like grammatical models and recursively defined constructs such as regular expressions, and are integral to machine models of context-free languagesThe treatment of constructive proofs (in particular, simulation-based proofs of computability) are cast in explicit algorithmic notation, which is familiar to the Computer Science student