Image from Amazon.com
Introduction to Automata Theory Languages, and Computation / John E Hopcroft.
Material type:
TextLanguage: English Publication details: New Delhi ; Calcutta : Narosa Publishing House, c1979 [Reprint 1996]Description: xii, 418 p. : ill. ; 21 cmISBN: - 81-85015-96-1
- 21 512.2 HOI 1996
Contents:
Preliminaries -- Finite automata and regular expressions -- Properties of regular sets -- Context-free grammars -- Pushdown automata -- Properties of context-free languages -- Turing machines -- Undecidability -- The Chomsky hierarchy -- Deterministic context-free languages -- Closure properties of families of languages -- Computational complexity theory -- Intractable problems --
Books
| 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
|
Central Library, University of Rajshahi | Non-fiction | 512.2 HOI 1996 (Browse shelf(Opens below)) | C-4 | Available | BDT | B20081 | |||||||||||
|
Books
|
Central Library, University of Rajshahi | Non-fiction | 512.2 HOI 1996 (Browse shelf(Opens below)) | C-3 | Available | BDT | A143821 | |||||||||||
|
Books
|
Central Library, University of Rajshahi | Non-fiction | 512.2 HOI 1996 (Browse shelf(Opens below)) | C-2 | Available | BDT | A143820 | |||||||||||
|
Books
|
Central Library, University of Rajshahi Reading Room | Non-fiction | 512.2 HOI 1996 (Browse shelf(Opens below)) | C-1 | Not For Loan | BDT | A143819 |
Browsing Central Library, University of Rajshahi shelves,Collection: Non-fiction Close shelf browser (Hides shelf browser)
| No cover image available | No cover image available |
|
|
|
|
|
||
| 512.2 HAT 1973 The theory of groups / | 512.2 HAT 1973 The theory of groups / | 512.2 HOI 1996 Introduction to Automata Theory Languages, and Computation / | 512.2 HOI 1996 Introduction to Automata Theory Languages, and Computation / | 512.2 HOI 1996 Introduction to Automata Theory Languages, and Computation / | 512.2 HOI 2009 Introduction to Automata Theory Languages, and Computation / | 512.2 HOI 2009 Introduction to Automata Theory Languages, and Computation / |
Preliminaries -- Finite automata and regular expressions -- Properties of regular sets -- Context-free grammars -- Pushdown automata -- Properties of context-free languages -- Turing machines -- Undecidability -- The Chomsky hierarchy -- Deterministic context-free languages -- Closure properties of families of languages -- Computational complexity theory -- Intractable problems --
There are no comments on this title.
Log in to your account to post a comment.