A Concise Introduction to Languages and Machines

By Alan P. Parkes

A Concise Introduction to Languages and Machines Cover Image

This easy-to-follow text provides an accessible introduction to the key topics of formal languages and abstract machines within Computer Science. The author follows the formula of his first book, but makes these core computing topics more fundamental.

Full Description

  • ISBN13: 978-1-8480-0120-6
  • 360 Pages
  • User Level: Students
  • Publication Date: June 29, 2009
  • Available eBook Formats: PDF
  • eBook Price: $49.95
Buy eBook Buy Print Book Add to Wishlist

Related Titles

Full Description
A Concise Introduction to Languages, Machines and Logic provides an accessible introduction to three key topics within computer science: formal languages, abstract machines and formal logic. Written in an easy-to-read, informal style, this textbook 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, - Chapter opening overviews providing an introduction and guidance to each topic, - End-of-chapter exercises and solutions, - Offers an intuitive approach to the topics. This reader-friendly textbook has been written with undergraduates in mind and will be suitable for use on course covering formal languages, formal logic, computability and automata theory. It will also make an excellent supplementary text for courses on algorithm complexity and compilers.
Table of Contents

Table of Contents

  1. Introduction.
  2. Part One: Languages and Machines.
  3. Elements of Formal Languages.
  4. Syntax, Semantics and Ambiguity.
  5. Regular Languages and Finite State.
  6. Context Free Languages and Pushdown Recognisers.
  7. Important Features of Regular and Context Free Languages.
  8. Phrase Structure Languages and Turing Machines.
  9. Part Two: Machines and Computation.
  10. Finite State Transducers.
  11. Turing Machines as Computers.
  12. Turing’s Thesis and The Universality of the Turing Machine.
  13. Computability, Solvability and the Halting Problem.
  14. Dimensions of Computation.
  15. Further Reading.
  16. Solutions to Selected Exercises.
Errata

Please Login to submit errata.

No errata are currently published