| 000 | 01033nam a2200181Ia 4500 | ||
|---|---|---|---|
| 999 |
_c2253 _d2253 |
||
| 003 | OSt | ||
| 005 | 20200219122713.0 | ||
| 008 | 140801s1999 xx 000 0 und d | ||
| 020 | _a9788131720479 | ||
| 100 | _aHopcroft, John E | ||
| 245 | _aIntroduction to Automata Theory Languages, and Computation | ||
| 250 | _a3rd | ||
| 260 |
_bPearson Pub. _c1999 _aNew Delhi |
||
| 300 | _a487p. | ||
| 500 | _aAutomata: 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 | ||
| 856 | _uhttps://books.google.co.in/books?id=tzttuN4gsVgC&printsec=frontcover&dq=introduction+to+automata+theory+languages+and+computation&hl=en&sa=X&ved=0ahUKEwjn8p6u-7XgAhWBO48KHXC6AnQQ6AEIKDAA#v=onepage&q=introduction%20to%20automata%20theory%20languages%20and%20computation&f=false | ||
| 942 |
_2ddc _cBK _02 |
||