Introduction to languages and the theory of computation /
Material type:
TextPublication details: Boston : McGraw-Hill, c2003.Edition: 4th edDescription: xii, 436 p. : illISBN: - 9780071289429
- QA267.5 M37 2011
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Books
|
Spec. Study Centre Immigration, Gwagwalada, Abuja | QA267.55A .M37 2011 (Browse shelf(Opens below)) | Available | 02013490 |
Browsing Spec. Study Centre Immigration, Gwagwalada, Abuja shelves Close shelf browser (Hides shelf browser)
| QA154.3 .L37 1997 Algebra and trigonometry : | QA154.3 .O65 2006 College Algebra | QA218.2 .A66 2005 Applied linear statistical models / | QA267.55A .M37 2011 Introduction to languages and the theory of computation / | QA276 .B73 2009 UNDERSTANDABLE STATISTICS CONCEPTS AND METHODS | QA276.O77 2001 An introduction to statistical methods and data analysis. | QA276.12 .U78 2004 Mind on statistics / |
Including Indexes
Mathematical Notation and Techniques -- Basic Mathematical Objects -- Mathematical Induction and Recursive Definitions -- Regular Languages and Finite Automata -- Regular Languages and Finie Automata -- Nondeterminism and Kleene's Theorem -- Regular and Nonregular Languages -- Context-Free Languages and Pushdown Automata -- Context-Free Grammars -- Pushdown Automata -- Context-Free and Non-Context-Free Languages -- Turing Machines and Their Languages -- Turing Machines -- Recursively Enumerable Languages -- Unsolvable Problems and Computable Functions -- Unsolvable Problems -- Computable Functions -- Introduction to Computational Complexity -- Measuring and Classifying Complexity -- Tractable and Intractable Problems.
There are no comments on this title.