Skip to content

Second Course in Formal Languages and Automata Theory

ISBN-10: 0521865727

ISBN-13: 9780521865722

Edition: 2009

Authors: Jeffrey Shallit

List price: $88.00
Shipping box This item qualifies for FREE shipping.
Blue ribbon 30 day, 100% satisfaction guarantee!
Buy eBooks
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Description:

Intended for graduate students and advanced undergraduates in computer science, A Second Course in Formal Languages and Automata Theory treats topics in the theory of computation not usually covered in a first course. After a review of basic concepts, the book covers combinatorics on words, regular languages, context-free languages, parsing and recognition, Turing machines, and other language classes. Many topics often absent from other textbooks, such as repetitions in words, state complexity, the interchange lemma, 2DPDAs, and the incompressibility method, are covered here. The author places particular emphasis on the resources needed to represent certain languages. The book also includes a diverse collection of more than 200 exercises, suggestions for term projects, and research problems that remain open.
Customers also bought

Book details

List price: $88.00
Copyright year: 2009
Publisher: Cambridge University Press
Publication date: 9/8/2008
Binding: Hardcover
Pages: 254
Size: 6.25" wide x 9.25" long x 0.75" tall
Weight: 1.034

Preface
Review of formal languages and automata theory
Sets
Symbols, strings, and languages
Regular expressions and regular languages
Finite automata
Context-free grammars and languages
Turning machines
Unsolvability
Complexity theory
Exercises
Projects
Research problems
Notes on Chapter 1
Combinatorics on words
Basics
Morphisms
The theorems of Lyndon-Schutzenberger
Conjugates and borders
Repetitions in strings
Applications of the Thue-Morse sequence and squarefree strings
Exercises
Projects
Research problems
Notes on Chapter 2
Finite automata and regular languages
Moore and Mealy machines
Quotients
Morphisms and substitutions
Advanced closure properties of regular languages
Transducers
Two-way finite automata
The transformation automaton
Automata, graphs, and Boolean matrices
The Myhill-Nerode theorem
Minimization of finite automata
State complexity
Partial orders and regular languages
Exercises
Projects
Research problems
Notes on Chapter 3
Context-free grammars and languages
Closure properties
Unary context-free languages
Ogden's lemma
Applications of Ogden's lemma
The interchange lemma
Parikh's theorem
Deterministic context-free languages
Linear languages
Exercises
Projects
Research problems
Notes on Chapter 4
Parsing and recognition
Recognition and parsing in general grammars
Earley's method
Top-down parsing
Removing LL(1) conflicts
Bottom-up parsing
Exercises
Projects
Notes on Chapter 5
Turing machines
Unrestricted grammars
Kolmogorov complexity
The incompressibility method
The busy beaver problem
The Post correspondence problem
Unsolvability and context-free languages
Complexity and regular languages
Exercises
Projects
Research problems
Notes on Chapter 6
Other language classes
Context-sensitive languages
The Chomsky hierarchy
2DPDAs and Cook's theorem
Exercises
Projects
Research problems
Notes on Chapter 7
Bibliography
Index