Introduction to Languages, Machines and Logic

Computable Languages, Abstract Machines and Formal Logic

Alan P. Parkes

352 pages, parution le 21/05/2002

Ajouter à une liste

Indisponible

Résumé

This book provides an accessible introduction to three key topics within computer science: formal languages, abstract machines and formal logic. It is written in an easy-to-read, informal style and assumes only a basic knowledge of programming on the part of the reader.
The approach is deliberately non-mathematical and features: - Clear explanations of formal notation and jargon
- Extensive use of examples to illustrate algorithms and proofs
- Pictorial representations of key concepts
- Lots of end-of-chapter exercises
Introduction to Languages, Machines and Logic is suitable for use on courses covering formal languages, formal logic, computability and automata theory. It will also make an excellent supplementary text for courses on algorithm complexity and compilers.

Contents

Part I - Languages and Machines
- Elements of Formal Languages
- Syntax, Semantics and Ambiguity
- Regular Languages and Finite State Recognisers
- Context-Free Languages and Pushdown Recognisers
- Important Features of Regular and Context-Free Languages
- Phrase Structure Languages and Turing Machines
Part II - Machines and Computation
- Finite State Transducers
- Turing Machines as Computers
- Turing's Thesis and the Universality of the Turing Machine
- Computability, Solvability, and the Halting Problem
- Dimensions of Computation
Part III - Computation and Logic
- Boolean Logic and Propositional Logic
- First Order Predicate Logic
- Logic and Computation

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	Alan P. Parkes
Parution	21/05/2002
Nb. de pages	352
Format	15,5 x 23,5
Couverture	Broché
Poids	629g
Intérieur	Noir et Blanc
EAN13	9781852334642
ISBN13	978-1-85233-464-2