Image from Amazon.com
Theory of computer science : automata, languages and computation K.L.P. Mishra & N. Chandrasekaran
Material type:
TextLanguage: English Publication details: Delhi PHI learning 2022Edition: 3rd edDescription: xiii, 422 P.BISBN: - 9788120329683
- 004.01 MIS(THE)Ed3
| Item type | Current library | Collection | Call number | Copy number | Status | Barcode | |
|---|---|---|---|---|---|---|---|
REFERENCE COMPUTER SCIENCE
|
St. Xavier's University, Kolkata Reference Section | Reference | R 004.01 MIS(THE)Ed3 (Browse shelf(Opens below)) | 7364 | Not For Loan | UCS7364 | |
|
COMPUTER SCIENCE
|
St. Xavier's University, Kolkata Lending Section | 004.01 MIS(THE)Ed3.C1 (Browse shelf(Opens below)) | 7365 | Available | CS7365 | ||
|
COMPUTER SCIENCE
|
St. Xavier's University, Kolkata Lending Section | 004.01 MIS(THE)Ed3.C2 (Browse shelf(Opens below)) | 7366 | Available | CS7366 | ||
|
COMPUTER SCIENCE
|
St. Xavier's University, Kolkata Lending Section | 004.01 MIS(THE)Ed3.C3 (Browse shelf(Opens below)) | 7367 | Available | CS7367 | ||
|
COMPUTER SCIENCE
|
St. Xavier's University, Kolkata Lending Section | 004.01 MIS(THE)Ed3.C4 (Browse shelf(Opens below)) | 7368 | Available | CS7368 |
Total holds: 0
Preface. Notations. 1. Propositions and Predicates. 2. Mathematical Preliminaries. 3. The Theory of Automata. 4. Formal Languages. 5. Regular Sets and Regular Grammars. 6. Context-Free Languages. 7. Pushdown Automata. 8. LR(k) Grammars. 9. Turing Machines and Linear Bounded Automata. 10. Decidability and Recursively Enumerable Languages. 11. Computability. 12. Complexity. Answers to Self-Tests. Solutions (or Hints) to Chapter-end Exercises. Further Reading. Index.
There are no comments on this title.
Log in to your account to post a comment.