Mostrar el registro sencillo del ítem
dc.creator | Sipser, Michael | |
dc.date.accessioned | 2020-05-27T16:49:27Z | |
dc.date.available | 2020-05-27T16:49:27Z | |
dc.date.issued | 2006 | |
dc.identifier.uri | http://hdl.handle.net/123456789/10077 | |
dc.description.abstract | 0. Introduction -- Part 1: Automata and languages -- 1. Regular languages -- 2. Context-free languages -- Part 2: Computability theory -- 3. The Church-Turing thesis -- 4. Decidability -- 5. Reducibility -- 6. Advanced topics in computability theory -- Part 3: Complexity theory -- 7. Time complexity -- 8. Space complexity -- 9. Intractability -- 10. Advanced topics in complexity theory. | es |
dc.language.iso | en | es |
dc.publisher | Thomson Course Technology | es |
dc.title | Introduction to the theory of computation | es |
uade.subject.descriptor | Computación | es |
uade.subject.descriptor | Informática | es |
uade.subject.descriptor | Lenguajes de Programación | es |
uade.edicion | 2nd ed. | es |
uade.identifier.isbn | 0534950973 | es |
academic.materia.codigo | 3.4.095 | es |
academic.materia.nombre | Teoría de la Computación | es |