An Introduction to Formal Languages and Automata

by Peter Linz, Susan H. Rodger

Overview

An Introduction to Formal Languages and Automata, Seventh Edition is designed for an introductory course on formal languages, automata, computability, and related matters forming what is known as the theory of computation. The text takes a problem-solving approach, in which students' abilities are tested at various levels. The Seventh Edition familiarizes students with the foundations and principles of computer science, teaches material useful in subsequent courses, and strengthens students' ability to carry out formal and rigorous mathematical arguments. New Introductory Exercises help to bridge concepts to more difficult exercises Chapter s 1-14 of the sixth edition, with the new exercises, are now reorganized as Part I: Theory NEW - Three NEW chapters on parsing are included in a new section, Part 2: Applications, and focus on how to apply theory from previous chapters into the real worldThe accessible approach allows student to clearly understand key content while retaining the appropriate mathematical notations and theorems required for the courseCentral ideas are preceded by a motivating example, drawn from applications, that introduces the concept and illustrates its usefulness © 2023 | 572 pages

Product Details

ISBN-13:	9781284231601
Publisher:	Jones & Bartlett Learning
Publication date:	03/04/2022
Edition description:	7th ed.
Pages:	572
Product dimensions:	7.24(w) x 8.98(h) x 1.34(d)

About the Author

Peter Linz, Professor Emeritus, University of California, Davis Peter Linz is Professor Emeritus in the Department of Computer Science at the University of California, Davis.'Linz received his Ph.D. from the University of Wisconsin.'Professor Linz's research emphasizes the development of a theory of numerical analysis that can be used in the construction of reliable numerical methods used in the design of problem-solving environments for scientific computing.'Linz has released the seventh edition of An Introduction to Formal Languages and Automata, as well as Exploring Numerical Methods: An Introduction to Scientific Computing.'

Susan H. Rodger is Professor of the Practice of Computer Science at Duke University. She received her Ph.D. in Computer Science from Purdue University. Rodger works in the area of computer science education. Her major contributions are in visualization and interaction software for education in theoretical computer science, computing in K-12 and peer-led team learning. Rodger developed JFLAP, software for experimenting with formal languages and automata. JFLAP is the leading educational tool for formal languages and automata theory and has been used around the world for over thirty years in several types of courses including formal languages and automata, compilers, artificial intelligence, and discrete mathematics. Rodger is a leader in integrating computing into K-12 with the Adventures in Alice Programming project. Rodger received the IEEE Computer Society 2019 Taylor L. Booth Education Award, ACM 2013 Karl V. Karlstrom Outstanding Educator Award, Duke University Trinity College 2019 David and Janet Vaughn Brooks Distinguished Teaching Award, and she was one of two finalist candidates for the NEEDS Premier Award for Excellence in Engineering Education Courseware for the software JFLAP.

Table of Contents

Chapter 1 Introduction to the Theory of Computation
Chapter 2 Finite Automata
Chapter 3 Regular Languages and Regular Grammars
Chapter 4 Properties of Regular Languages
Chapter 5 Context-Free Languages
Chapter 6 Simplification of Context-Free Grammars and Normal Forms
Chapter 7 Pushdown Automata
Chapter 8 Properties of Context-Free Languages
Chapter 9 Turing Machines
Chapter 10 Other Models of Turing Machines
Chapter 11 A Hierarchy of Formal Languages and Automata
Chapter 12 Limits of Algorithmic Computation
Chapter 13 Other Models of Computation
Chapter 14 An Overview of Computational Complexity

Editorial Reviews

Formal languages, automata, computability, and related matters form the major part of the theory of computation. This textbook is designed for an introductory course for computer science and computer engineering majors who have knowledge of some higher-level programming language, the fundamentals of data structures and algorithms, and discrete mathematics (including set theory, functions, relations, logic, and mathematical reasoning). Linz (U. of California, Davis) gives the motivation for proofs rather than their mathematical detail, focusing rather on the underlying principles as illustrated by examples. A sampling of topics covered includes finite and pushdown automata, regular and context-free languages and grammars, turing machines, and algorithmic and other models of computation. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Booknews