MARC details
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
090423s2008 nyua 001 0 eng |
| 010 ## - LIBRARY OF CONGRESS CONTROL NUMBER |
|---|
| LC control number |
2008928021 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9781848001206 |
| 035 ## - SYSTEM CONTROL NUMBER |
|---|
| System control number |
(Sirsi) u1487 |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
EG-CaNU |
| Transcribing agency |
EG-CaNU |
| Modifying agency |
EG-CaNU |
| 042 ## - AUTHENTICATION CODE |
|---|
| Authentication code |
ncode |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
005.136 |
| Edition number |
22 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Parkes, Alan. |
| 9 (RLIN) |
1749 |
| 245 12 - TITLE STATEMENT |
|---|
| Title |
A concise introduction to languages and machines / |
| Statement of responsibility, etc. |
Alan P. Parkes. |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
1st ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
New York : |
| Name of publisher, distributor, etc. |
Springer, |
| Date of publication, distribution, etc. |
2009. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
vii, 243 p. : |
| Other physical details |
ill. ; |
| Dimensions |
24 cm. |
| 490 0# - SERIES STATEMENT |
|---|
| Series statement |
Undergraduate topics in computer science |
| 500 ## - GENERAL NOTE |
|---|
| General note |
Includes index. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
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. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
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. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
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 |
| 596 ## - |
|---|
| -- |
1 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Machine languages |
| 9 (RLIN) |
107 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Formal languages. |
| 9 (RLIN) |
1750 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Machine theory. |
| 9 (RLIN) |
107 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Computable functions. |
| 9 (RLIN) |
1751 |
| 920 ## - |
|---|
| -- |
1848001207 |