|
|
|
|
| LEADER |
01491nam a2200289 i 4500 |
| 003 |
AR-BaUNH |
| 005 |
20260131104849.0 |
| 007 |
ta |
| 008 |
250923s2009||||xx ad|||r|||||||| ||eng|| |
| 020 |
|
|
|a 9780387096384
|
| 040 |
|
|
|a AR-BaUNH
|b eng
|c AR-BaUNH
|
| 041 |
0 |
|
|a eng
|
| 082 |
1 |
|
|2 14
|a 004.01
|
| 100 |
1 |
|
|a Rosenberg, Arnold L.,
|d 1941-
|9 10755
|e aut
|
| 245 |
1 |
4 |
|a The pillars of computation theory :
|b state, encoding, nondeterminism
|
| 260 |
|
|
|a Amherst :
|b Springer,
|c 2009.
|
| 300 |
|
|
|a xvii, 324 páginas :
|b ilustraciones, gráficos ;
|c 23 cm
|
| 336 |
|
|
|a txt
|
| 337 |
|
|
|a n
|
| 338 |
|
|
|a nc
|
| 505 |
|
|
|a Preface.--
|a List of acronyms.--
|t Prolegomena.
|a Introduction.-- Mathematical preliminaries.--
|t State.
|a Online automata: exemplars of "state".-- Finite automata and regular languages.-- Applications of the Myhill-Nerode Theorem.-- Enrichment topics.--
|t Encoding.
|a Countability and uncountability: the precursors of "Encoding".-- Enrichment topic: "efficient" pairing function, with applications.-- Computability theory.--
|t Nondeterminism.
|a Nondeterministic online automata.-- Nondeterministic FAs.-- Nondeterminism in conputability theory.-- Complexity theory.--
|a Sample exercises.--
|a References.--
|a Index.
|
| 650 |
|
7 |
|a TEORÍA DE LA COMPUTACIÓN
|2 Disciplinas FORD
|9 10088
|
| 650 |
|
7 |
|a AUTÓMATAS PROGRAMABLES
|2 Disciplinas FORD
|9 10087
|
| 900 |
|
|
|a Alejandra
|
| 901 |
|
|
|a LKF
|b Teoría de la computación
|c Bibliografía Complementaria
|
| 942 |
|
|
|c PRES
|n 0
|2 ddc
|
| 999 |
|
|
|c 7956
|d 7958
|