An introduction to formal languages and automata / Peter Linz.
Material type: TextLanguage: English Publisher: Burlington, MA : Jones & Bartlett Learning, c2017Edition: 6th edDescription: 1 online resource (xiii, 449 p.)Content type:- text
- unmediated
- volume
- 9781284077247 (casebound)
- 005.13/1 23
- QA267.3 .L56 2017
Item type | Current library | Collection | Shelving location | Call number | Copy number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|---|
eBook (Electronic Book) | North South University Library | Non-fiction | Online | QA267.3L56 2017 (Browse shelf(Opens below)) | 1 | 1 | 500010263 |
Browsing North South University Library shelves, Shelving location: Online, Collection: Non-fiction Close shelf browser (Hides shelf browser)
QA184.A58 2005 Elementary linear algebra / | QA184.2.A58 2015 Elementary linear algebra : with supplemental applications / | QA267.S57 2013 Introduction to the theory of computation / | QA267.3L56 2017 An introduction to formal languages and automata / | QA273.B35 2003 A primer on statistical distributions / | QA276.12.M36 2010 Introductory statistics / | QA276.12.M36 2013 Introductory statistics / |
Includes bibliographical references and index.
An Introduction to Formal Languages and Automata, Sixth Edition provides an accessible, student-friendly presentation of all material essential to an introductory Theory of Computation course. Written to address the fundamentals of formal languages, automata, and computability, the text is designed to familiarize students with the foundations and principles of computer science and to strengthen the students' ability to carry out formal and rigorous mathematical arguments. The author, Peter Linz, continues to offer a straightforward, uncomplicated treatment of formal languages and automata and avoids excessive mathematical detail allowing students to focus on and understand the key underlying principles. New & Key Features: • An accessible approach allows students to clearly understand key content while retaining the appropriate mathematical notations and theorems required for the course • New Chapter Synopsis, found at the end of each chapter, recap important concepts found in the text • Every major idea is preceded by a motivating example, drawn from applications, that introduces the concept and illustrates its usefulness • The exercise section has been restructured and improved with accessible exercises more closely tied to examples in the text • An enhanced Instructor's Manual includes more detailed solutions to problems found in the text
Computer Science & Engineering
Md. Abdul Hakim
Md. Rifat Mahmud
There are no comments on this title.