| 000 | 01191nam a2200253 a 4500 | ||
|---|---|---|---|
| 003 | AR-LpUFIB | ||
| 005 | 20250311170244.0 | ||
| 008 | 230201s1979 xxu r 000 0 eng d | ||
| 020 | _a020102988X | ||
| 024 | 8 |
_aDIF-M2543 _b2633 _zDIF002444 |
|
| 040 |
_aAR-LpUFIB _bspa _cAR-LpUFIB |
||
| 100 | 1 | _aHopcroft, John E. | |
| 245 | 1 | 0 | _aIntroduction to automata theory, languages, and computation |
| 250 | _a1a ed. | ||
| 260 |
_aReading : _b[S.n.], _c1979 |
||
| 490 | 0 | _aAddison-Wesley series in computer science | |
| 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 | |
| 650 | 4 | _aLENGUAJES FORMALES | |
| 650 | 4 | _aCOMPLEJIDAD COMPUTACIONAL | |
| 700 | 1 | _aUllman, Jeffrey D. | |
| 942 | _cBK | ||
| 999 |
_c52330 _d52330 |
||