Posted by **advisors** at Jan. 21, 2015

2006 | 550 Pages | ISBN: 0321455363 | PDF | 6 MB

Posted by **ChrisRedfield** at May 17, 2014

Published: 2000-11-24 | ISBN: 0201441241 | PDF | 521 pages | 56 MB

Posted by **Specialselection** at Feb. 20, 2014

English | 2000-11-24 | ISBN: 0201441241 | 521 pages | PDF | 56.6 mb

Posted by **Alexpal** at April 13, 2006

Addison Wesley | ISBN 0201441241 | 2000 Year | DjVu | 9,23 Mb | 521 Pages

Posted by **tanas.olesya** at Dec. 4, 2015

English | 22 Jun. 2006 | ISBN: 0521848873, 0251613248 | 264 Pages | PDF | 5 MB

Recent applications to biomolecular science and DNA computing have created a new audience for automata theory and formal languages. This is the only introductory book to cover such applications. It begins with a clear and readily understood exposition of the fundamentals that assumes only a background in discrete mathematics.

Posted by **arundhati** at Oct. 7, 2015

2004 | ISBN-10: 9810247273 | 212 pages | PDF | 10 MB

Posted by **arundhati** at Aug. 17, 2015

2008 | ISBN-10: 0521865727 | 254 pages | PDF | 1,5 MB

Posted by **Underaglassmoon** at Jan. 2, 2015

English | Discrete Mathematics | 22. June 2006 | ISBN-10: 0521848873 | 264 pages | pdf | 2 mb

Recent applications to biomolecular science and DNA computing have created a new audience for automata theory and formal languages.

Posted by **MoneyRich** at Dec. 11, 2014

English | July 17, 2000 | ISBN: 1852330740 | 920 pages | PDF | 70 MB

A step-by-step development of the theory of automata, languages and computation. Intended for use as the basis of an introductory course at both junior and senior levels, the text is organized so as to allow the design of various courses based on selected material. It features basic models of computation, formal languages and their properties; computability, decidability and complexity; a discussion of modern trends in the theory of automata and formal languages; design of programming languages, including the development of a new programming language; and compiler design, including the construction of a complete compiler. Alexander Meduna uses clear definitions, easy-to-follow proofs and helpful examples to make formerly obscure concepts easy to understand. He also includes challenging exercises and programming projects to enhance the reader's comprehension, and many 'real world' illustrations and applications in practical computer science.

Posted by **karapuzik** at Dec. 12, 2008

360 pages | New Age International (P) Ltd. (2006) | ISBN-10: 8122415083 | PDF | 2 Mb

This book is aimed at providing an introduction to the basic models of computability to the undergraduate students. The book is devoted to finite automata and their properties. Pushdown automata provides a class of models and enables the analysis of context-free languages. Turing machines have been introduced and the book discusses computability and decidability. A number of problems with solutions have been provided for each chapter. A lot of exercises have been given with hints/answers to most of these tutorial problems.