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-1Subject(s): Automates mathématiques, Théorie deDDC classification: 512.2 Online resources: worldcat detales
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
| Item type | Current library | Collection | Call number | Copy number | Status | Notes | Date due | Barcode |
|---|---|---|---|---|---|---|---|---|
|
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 | |
|
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 | 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-4 | Available | BDT | B20081 |
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.