| 000 | 01255nam a2200265 a 4500 | ||
|---|---|---|---|
| 003 | AR-LpUFIB | ||
| 005 | 20240131170550.0 | ||
| 007 | ta | ||
| 008 | 230201s1979 xxu dr 000 0 eng d | ||
| 020 | _a020102988X | ||
| 024 | 8 | _aDIF002433 | |
| 040 |
_aAR-LpUFIB _bspa _cAR-LpUFIB |
||
| 100 | 1 |
_aHopcroft, John E. _9251829 |
|
| 245 | 1 | 0 | _aIntroduction to automata theory, languages, and computation |
| 250 | _a1a ed. | ||
| 260 |
_aReading : _b, _c1979 |
||
| 490 | 0 | _a(Addison-Wesley series in computer science / Michael A. Harrison, ed.) | |
| 500 | _aCopia anillada. -- | ||
| 505 | 0 | _a 1- Preliminaries 2- Finite automata and regular expressions 3- Properties of regular sets 4- Context-free grammars 5- Pushdown automata 6- Properties of context-free languages 7- Turing machines 8- Undecidability 9- The Chomsky hierarchy 10- Deterministic context-free languages 11- Closure properties of families of languages 12- Computational complexity theory 13- Intractable problems 14- Highlights of other important language classes -- Bibliography (p. 396-410) -- Index. | |
| 650 | 4 |
_aAUTÓMATAS _9248305 |
|
| 650 | 4 |
_aLENGUAJES FORMALES _9247830 |
|
| 650 | 4 |
_aCOMPLEJIDAD COMPUTACIONAL _9248377 |
|
| 700 | 1 |
_aUllman, Jeffrey D. _9247849 |
|
| 942 | _cFT | ||
| 999 |
_c844563 _d844563 |
||