|
|
|
|
| LEADER |
01710cam a22004697a 4500 |
| 001 |
BIBLO-27120 |
| 003 |
AR-BaUEN |
| 005 |
20250212163645.0 |
| 008 |
980505s1979 xxu||||f |||| 00| 0|spa|d |
| 040 |
|
|
|a AR-BaUEN
|b spa
|c AR-BaUEN
|
| 020 |
|
|
|a 020102988X
|
| 044 |
|
|
|a xxu
|
| 080 |
|
|
|a 681.334
|
| 100 |
1 |
|
|a Hopcroft, John E.
|
| 245 |
1 |
0 |
|a Introduction to automata theory, languages, and computation
|
| 260 |
|
|
|a Reading, MA :
|b Addison-Wesley,
|c c1979
|
| 300 |
|
|
|a 418 p.
|
| 490 |
0 |
|
|a Addison-Wesley series in computer science
|
| 505 |
0 |
0 |
|g Chapter 1
|t Preliminaries
|
| 505 |
0 |
0 |
|g Chapter 2
|t Finite Automata and Regular Expressions
|
| 505 |
0 |
0 |
|g Chapter 3
|t Properties of Regular Sets
|
| 505 |
0 |
0 |
|g Chapter 4
|t Context-Free Grammars
|
| 505 |
0 |
0 |
|g Chapter 5
|t Pushdown Automata
|
| 505 |
0 |
0 |
|g Chapter 6
|t Properties of Context-Free Languages
|
| 505 |
0 |
0 |
|g Chapter 7
|t Turing Machines
|
| 505 |
0 |
0 |
|g Chapter 8
|t Undecidability
|
| 505 |
0 |
0 |
|g Chapter 9
|t The Chomsky Hierarchy
|
| 505 |
0 |
0 |
|g Chapter 10
|t Deterministic Context-Free Languages
|
| 505 |
0 |
0 |
|g Chapter 11
|t Closure Properties of Families of Languages
|
| 505 |
0 |
0 |
|g Chapter 12
|t Computational Complexity Theory
|
| 505 |
0 |
0 |
|g Chapter 13
|t Intractable Problems
|
| 505 |
0 |
0 |
|g Chapter 14
|t Highlights of Other Important Language Classes
|
| 505 |
0 |
0 |
|t Bibliography
|
| 505 |
0 |
0 |
|t Index
|
| 653 |
1 |
0 |
|a TEORIA DE AUTOMATAS
|
| 653 |
1 |
0 |
|a TEORIA DE LA COMPUTACION
|
| 653 |
1 |
0 |
|a AUTOMATA FINITO
|
| 653 |
1 |
0 |
|a AUTOMATA DE PILA
|
| 653 |
1 |
0 |
|a AUTOMATAS DE RECURSOS LIMITADOS
|
| 653 |
1 |
0 |
|a LENGUAJES FORMALES
|
| 700 |
1 |
|
|a Ullman, Jeffrey D.
|
| 962 |
|
|
|a info:eu-repo/semantics/book
|a info:ar-repo/semantics/libro
|b info:eu-repo/semantics/publishedVersion
|