Introduction to automata theory, languages, and computation/ John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman.
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
Contents:
Automata: The Methods and the Madness
Finite Automata
Regular Expressions and Languages
Properties of Regular Languages
Context-Free Grammars and Languages
Pushdown Automata
Properties of Context-Free Languages
Introduction to Turing Machines
Undecidability
Intractable Problems
Additional Classes of Problems
Item type | Current library | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
![]() |
Central Library, Sikkim University General Book Section | 005.131 HOP/I (Browse shelf(Opens below)) | Available | P33310 | ||
![]() |
Central Library, Sikkim University General Book Section | 005.131 HOP/I (Browse shelf(Opens below)) | Available | P33307 | ||
![]() |
Central Library, Sikkim University General Book Section | 005.131 HOP/I (Browse shelf(Opens below)) | Available | P33306 | ||
![]() |
Central Library, Sikkim University General Book Section | 005.131 HOP/I (Browse shelf(Opens below)) | Available | P33309 | ||
![]() |
Central Library, Sikkim University General Book Section | 005.131 HOP/I (Browse shelf(Opens below)) | Available | P33308 | ||
![]() |
Central Library, Sikkim University General Book Section | 005.131 HOP/I (Browse shelf(Opens below)) | Available | P19784 |
Total holds: 0
Browsing Central Library, Sikkim University shelves, Shelving location: General Book Section Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
005.13 SCH/J Java: the complete reference / | 005.13 SCH/J Java/ | 005.131 HOP/I Introduction to automata theory, languages, and computation/ | 005.131 HOP/I Introduction to automata theory, languages, and computation/ | 005.131 HOP/I Introduction to automata theory, languages, and computation/ | 005.131 HOP/I Introduction to automata theory, languages, and computation/ | 005.131 HOP/I Introduction to automata theory, languages, and computation/ |
Automata: The Methods and the Madness
Finite Automata
Regular Expressions and Languages
Properties of Regular Languages
Context-Free Grammars and Languages
Pushdown Automata
Properties of Context-Free Languages
Introduction to Turing Machines
Undecidability
Intractable Problems
Additional Classes of Problems
There are no comments on this title.