000 01213 a2200253 4500
003 Nust
005 20220815091417.0
010 _a 00064608
020 _a0201441241
040 _cNust
082 0 0 _a005.133,HOP
100 1 _aHopcroft, John E.,
_984584
245 1 0 _aIntroduction to automata theory, languages, and computation /
_cJohn E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman.
250 _a2nd ed.
260 _aBoston :
_bAddison-Wesley,
_cc2001.
300 _axiv, 521 p. :
_bill. ;
_c25 cm.
505 _aAutomata: The Methods and the Madness (Page-1), Finite Automata (Page-37), Regular Expressions and Languages (Page-83), Properties of Regular Languages (Page-125), Context-Free Grammars and Languages (Page-169), Pushdown Automata (Page-219), Properties of Context-Free Languages (Page-255), Introduction to Turing Machines (Page-307), Undecidability (Page-367), Intractable Problems (Page-413), Additional Classes of Problems (Page-469),
650 0 _aComputational complexity.
_939112
650 0 _aFormal languages.
_918055
650 0 _aMachine theory.
_918056
700 1 _aMotwani, Rajeev.
_997078
700 1 _aUllman, Jeffrey D.,
_d1942-
_994174
942 _2ddc
_cBK
_k005.133,HOP
999 _c179399
_d179399