Summer Reading B2G1 Free
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Visit our stores


    Recently Viewed clear list


    Q&A | July 20, 2015

    Jesse Ball: IMG Powell’s Q&A: Jesse Ball



    Describe your latest book. I woke up one day from a sort of daydream with an idea for a book's structure, and for the thread of that book, one... Continue »
    1. $16.80 Sale Hardcover add to wish list

      A Cure for Suicide

      Jesse Ball 9781101870129

    spacer

On Order

$56.95
New Trade Paper
Currently out of stock.
Add to Wishlist
available for shipping or prepaid pickup only
Qty Store Section
- Local Warehouse Mathematics- Logic and Philosophy

A Concise Introduction to Languages and Machines (Undergraduate Topics in Computer Science)

by

A Concise Introduction to Languages and Machines (Undergraduate Topics in Computer Science) Cover

 

Synopses & Reviews

Publisher Comments:

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 successful formula of his first book on this subject, this time making these core computing topics more fundamental and providing an excellent foundation for undergraduates. The book is divided into two parts, Languages and Machines and Machines and Computation. The first part is concerned with formal language theory, as it applies to Computer Science, whereas Part 2 considers the computational properties of the machines in more detail. This text is deliberately non-mathematical and, wherever possible, links theory to practical considerations, in particular the implications for programming, computation and problem solving. Written in an informal style, this textbook assumes only a basic knowledge of programming on the part of the reader. 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 • An introductory chapter supplies the reader with a solid overview • End-of-chapter exercises and solutions This reader-friendly textbook has been written with undergraduates in mind and will be suitable for use on courses covering formal languages, computability, automata theory and computational linguistics. It will also make an excellent supplementary text for courses on algorithm complexity and compilers.

Synopsis:

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

Introduction.- Part One: Languages and Machines.- Elements of Formal Languages.- Syntax, Semantics and Ambiguity.- Regular Languages and Finite State.- Context Free Languages and Pushdown Recognisers.- Important Features of Regular and Context Free Languages.- Phrase Structure Languages and Turing Machines.- Part Two: 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.- Further Reading.- Solutions to Selected Exercises.

Product Details

ISBN:
9781848001206
Author:
Parkes, Alan P.
Publisher:
Springer
Editor:
MacKie, Ian
Subject:
Logic
Subject:
Computer Science
Subject:
Number Systems
Subject:
Machine Theory
Subject:
Formal languages
Subject:
Mathematics-Logic and Philosophy
Subject:
Abstract machines
Subject:
Automata
Subject:
Complexity
Subject:
computational science
Subject:
theoretical computer science
Subject:
Mathematical Logic and Formal Languages
Subject:
Computation by Abstract Devices
Subject:
Theory of computation
Subject:
Computational Mathematics and Numerical Analysis
Copyright:
Edition Description:
2008
Series:
Undergraduate Topics in Computer Science
Publication Date:
20080905
Binding:
TRADE PAPER
Language:
English
Illustrations:
Y
Pages:
360
Dimensions:
9.10x6.90x.70 in. 1.30 lbs.

Related Subjects

Computers and Internet » Artificial Intelligence » General
Computers and Internet » Computers Reference » General
Computers and Internet » Personal Computers » General
Computers and Internet » Software Engineering » Programming and Languages
Science and Mathematics » Mathematics » Foundations and Logic
Science and Mathematics » Mathematics » Introduction
Science and Mathematics » Mathematics » Logic and Philosophy

A Concise Introduction to Languages and Machines (Undergraduate Topics in Computer Science) New Trade Paper
0 stars - 0 reviews
$56.95 Backorder
Product details 360 pages Springer - English 9781848001206 Reviews:
"Synopsis" by , 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.
spacer
spacer
  • back to top

FOLLOW US ON...

     
Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.