|
|
|
|
| LEADER |
00000nam a2200000 a 4500 |
| 003 |
AR-LpUFIB |
| 005 |
20250311170244.0 |
| 008 |
230201s1979 xxu r 000 0 eng d |
| 020 |
|
|
|a 020102988X
|
| 024 |
8 |
|
|a DIF-M2543
|b 2633
|z DIF002444
|
| 040 |
|
|
|a AR-LpUFIB
|b spa
|c AR-LpUFIB
|
| 100 |
1 |
|
|a Hopcroft, John E.
|
| 245 |
1 |
0 |
|a Introduction to automata theory, languages, and computation
|
| 250 |
|
|
|a 1a ed.
|
| 260 |
|
|
|a Reading :
|b [S.n.],
|c 1979
|
| 490 |
0 |
|
|a Addison-Wesley series in computer science
|
| 500 |
|
|
|a Copia 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 |
|a AUTÓMATAS
|
| 650 |
|
4 |
|a LENGUAJES FORMALES
|
| 650 |
|
4 |
|a COMPLEJIDAD COMPUTACIONAL
|
| 700 |
1 |
|
|a Ullman, Jeffrey D.
|
| 942 |
|
|
|c BK
|
| 952 |
|
|
|0 0
|1 0
|4 0
|6 F11_HOP
|7 0
|9 76863
|a DIF
|b DIF
|d 2008-12-09
|i DIF-F156
|l 0
|o F.1.1 HOP
|p DIF-F156
|r 2025-03-11 17:02:44
|w 2025-03-11
|y BK
|
| 999 |
|
|
|c 52330
|d 52330
|
