Introduction to computer theory / Daniel I.A. Cohen.
Material type:
TextPublisher: New York : Wiley, [1997]Copyright date: c1997Edition: 2nd edDescription: xiv, 634 pages : illustrations ; 27 cmContent type: - text
- unmediated
- volume
- 0471137723
- 9780471137726
- 511.3 21 C.D.I
Contents:
Background -- Languages -- Recursive definitions -- Regular expressions -- Finite automata -- Transition graphs -- Kleene's theorem -- Finite automata with output -- Regular languages -- Nonregular languages -- Decidability -- Context-free grammars -- Grammatical format -- Pushdown automata -- DFG = PDA -- Non-context-free languages -- Context-free languages -- Decidability -- Turing machines -- Post machines -- Minsky's theorem -- Variations on the TM -- TM languages -- The Chomsky hierarchy -- Computers.
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | Course reserves |
|---|---|---|---|---|---|---|---|
Books
|
Main library A8 | Computers & Information Technology ( Computer Science ) | 511.3 C.D.I (Browse shelf(Opens below)) | Available | 00013703 | ||
|
Books
|
Main library A8 | Computers & Information Technology ( Computer Science ) | 511.3 C.D.I (Browse shelf(Opens below)) | Available | 00014076 | ||
|
Books
|
Main library A8 | Computers & Information Technology ( Computer Science ) | 511.3 C.D.I (Browse shelf(Opens below)) | Available | 00006987 |
Browsing Main library shelves, Shelving location: A8 Close shelf browser (Hides shelf browser)
| No cover image available | ||||||||
| 511.3 B.J.S Structural complexity / | 511.3 C.D.I Introduction to computer theory / | 511.3 C.D.I Introduction to computer theory / | 511.3 C.D.I Introduction to computer theory / | 511.3 J.R.D Discrete mathematics / | 511.3 L.W.M Mathematical logic : foundations for information science / | 511.3 R.E.A Automata, computability and complexity : theory and applications / |
Includes bibliographical references (pages 619-620) and index.
Background -- Languages -- Recursive definitions -- Regular expressions -- Finite automata -- Transition graphs -- Kleene's theorem -- Finite automata with output -- Regular languages -- Nonregular languages -- Decidability -- Context-free grammars -- Grammatical format -- Pushdown automata -- DFG = PDA -- Non-context-free languages -- Context-free languages -- Decidability -- Turing machines -- Post machines -- Minsky's theorem -- Variations on the TM -- TM languages -- The Chomsky hierarchy -- Computers.
There are no comments on this title.