| 000 | 01237 a2200253 4500 | ||
|---|---|---|---|
| 003 | Nust | ||
| 005 | 20220729114902.0 | ||
| 010 | _a 2009005596 | ||
| 020 | _a0763776270 (hardcover) | ||
| 020 | _a9780763776275 (hardcover) | ||
| 035 | _a(OCoLC)ocn305419284 | ||
| 040 | _cNust | ||
| 082 | 0 | 0 | _a511.3,MOZ |
| 100 | 1 |
_aMozgovoy, Maxim. _995759 |
|
| 245 | 1 | 0 |
_aAlgorithms, Languages, Automata, and Compilers :(Include CD) _ba Practical Approach / _cMaxim Mozgovoy. |
| 260 |
_aSudbury, Mass. : _bJones and Bartlett Publishers, _cc2010. |
||
| 300 |
_axii, 345 p. : _bill. ; _c24 cm. + _e1 CD-ROM (4 3/4 in.) |
||
| 505 | _aRegular Language and Regular Expressions (Page-1), Finite Automata (Page-23), The Relations Between Finite Automata and Regular Expression (Page-75), Finite state Machines in Practice (Page-91), No regular Language and Context Free Grammars (Page-107), Pushdown Automata (Page-127), Parsing (Page-143), Complier Generation (Page-205), The Lindenmayer System (Page-237), Turing Machines (Page-259), Decidability and Complexity (Page-297). | ||
| 650 | 0 |
_aAlgorithms. _913771 |
|
| 650 | 0 |
_aFormal languages. _918055 |
|
| 650 | 0 |
_aMachine theory. _918056 |
|
| 651 |
_a(Include CD) _98953 |
||
| 942 |
_cREF _2ddc |
||
| 999 |
_c188410 _d188410 |
||