| 000 | 01052nam a22001937a 4500 | ||
|---|---|---|---|
| 999 |
_c38955 _d38955 |
||
| 003 | OSt | ||
| 020 | _a9788131720479 | ||
| 082 | _a511.35 HOP-I | ||
| 100 | _aHopcroft, John E | ||
| 245 | _aIntroduction to Automata Theory Languages and Computation | ||
| 250 | _a3rd | ||
| 260 |
_aNoida _bPearson Pub. _c2008 |
||
| 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 | ||
| 650 | _aAutomata: The Methods and the Madness, | ||
| 856 | _uhttps://books.google.co.in/books?id=oBqh1G17tokC&printsec=frontcover&dq=introduction+to+automata+theory+languages+and+computation&hl=en&sa=X&ved=0ahUKEwjGyff36vbfAhVNeisKHcpqCQMQ6AEIKDAA#v=onepage&q=introduction%20to%20automata%20theory%20languages%20and%20computation&f=false | ||
| 901 | _a25740 | ||
| 942 |
_2ddc _cBK |
||