Automata, formal languages, and turing mahines / Emre Sermutlu
Material type:
TextPublication details: [USA] : [Publisher not identified], c2020Description: v, 340 pages ; 23 cmISBN: 9798690145385Subject(s): MACHINE THEORY | FORMAL LANGUAGESLOC classification: QA 267.3 .S47 2020
Books
| Item type | Current library | Home library | Collection | Shelving location | Call number | Copy number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|---|---|
|
Books
|
National University - Manila | National University - Manila | Digital Forensic | General Circulation | GC QA 267.3 .S47 2020 (Browse shelf (Opens below)) | c.1 | Checked out | 09/17/2024 | NULIB000019491 |
Browsing National University - Manila shelves, Shelving location: General Circulation, Collection: Digital Forensic Close shelf browser (Hides shelf browser)
|
|
|
No cover image available |
|
|
No cover image available | ||
| GC QA 76.774.L46 .S3 2021 Linux cookbook : essential skills for Linux users and system and network administrators / | GC QA 76.774.M33 .W37 2022 The Art of mac malware : the guide to analyzing malicious software / | GC QA 267.3 .S26 2020 Understanding automata formal languages and grammar / | GC QA 267.3 .S47 2020 Automata, formal languages, and turing mahines / | GC QA 297.4 .K86 2020 Discrete mathematical structures : a succinct foundation / | GC QA 303.2 .K54 2022 Quick calculus : a self-teaching guide / | GC QA 303.2 .S66 2022 Calculus : essential skills practice workbook with full solutions- derivatives, limits and integrals / |
Includes bibliographical references and index.
Preface -- 1. Finite Automata -- 2. Nondeterminism -- 3. Regular Languages -- 4. Regular Expressions -- 5. Pumping Lemma -- 6. Context-Free Grammars -- 7. Different Forms of grammars -- 8. Pushdown Automata -- 9. Non-context Free Languages -- 10. Turing Machines - I -- 11. Turing machines II -- 12. An Undecidable Language -- 13, P and NP -- 14. NP- Complete Problems.
Turing Machines serve as valuable tools for comprehending the theoretical foundations of computer science, providing a panoramic view of all conceivable algorithms. Although this approach is highly enlightening, its abstract nature can pose challenges.
There are no comments on this title.