The Leading eBooks Store Online

for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, Sony Reader ...

New to eBooks.com?

Learn more

A Second Course in Formal Languages and Automata Theory

A Second Course in Formal Languages and Automata Theory
Add to cart
US$ 55.00
(If any tax is payable it will be calculated and shown at checkout.)
Written 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.
Cambridge University Press; September 2008
254 pages; ISBN 9780511434044
Read online, or download in secure PDF format