| 000 | 01024 a2200205 4500 | ||
|---|---|---|---|
| 003 | Nust | ||
| 005 | 20220729112832.0 | ||
| 010 | _a 2003055167 | ||
| 020 | _a1584882557 (alk. paper) | ||
| 040 | _cNust | ||
| 082 | 0 | 0 | _a511.3,LAW |
| 100 | 1 |
_aLawson, Mark V. _968664 |
|
| 245 | 1 | 0 |
_aFinite Automata / _cMark V. Lawson. |
| 260 |
_aBoca Raton : _bChapman & Hall/CRC, _cc2004. |
||
| 300 |
_axii, 307 p. : _bill. ; _c24 cm. |
||
| 505 | _aIntroduction to Finite Automata (Page-1), Recognizable Languages (Page-27), Non Deterministic Automata (Page-53), E-automata (Page-85), Kleene's Theorm (Page-97) Local Languages (Page-127),Minimal Automate (Page-141), The Transitions Monoid (Page-171), The Syntactic Monoid (Page-191), Algebraic Language Theory (Page-217), Star-free Languages (Page-235), Varieties of Languages (Page-265), A Discrete Mathematics (Page-279). | ||
| 650 | 0 |
_aMachine theory. _918056 |
|
| 856 | 4 | 2 |
_3Publisher description _uhttp://www.loc.gov/catdir/enhancements/fy0646/2003055167-d.html |
| 942 |
_cREF _2ddc |
||
| 999 |
_c176896 _d176896 |
||