| 000 | 01301nam a2200205Ia 4500 | ||
|---|---|---|---|
| 008 | 230309s9999 xx 000 0 und d | ||
| 020 | _a9788126520107 | ||
| 041 | _aeng | ||
| 082 | _a511.35 ANA | ||
| 100 | _aAnami, Basavaraj S | ||
| 245 | _aFormal Languages & Automata Theory | ||
| 260 |
_bWiley India Pvt.Ltd _a New Delhi _c2011 |
||
| 300 | _a236 | ||
| 520 | _aFormal Languages and Automata theory presents the theoretical aspects of computer science, and helps define infinite languages in finite ways; construct algorithms for related problems and decide whether a string is in language or not. These are of practical importance in construction of compilers and designing of programming languages, thus establishing the course as a core paper in third/fourth year of various universities. This book adopts a holistic approach to learning from fundamentals of formal languages to undecidability problems. Its organization follows the order in which the course is taught over the years, and is well-accepted by the student community. The contents of each topic motivate the reader to easily understand the concepts rather than remember and reproduce. | ||
| 650 | _aComputer Science | ||
| 650 | _aComputer Language | ||
| 650 | _aAutomata | ||
| 700 | _aK G, Karibasappa | ||
| 942 |
_2ddc _cBK |
||
| 999 |
_c43322 _d43322 |
||