{"id":6765,"date":"2018-12-18T14:40:31","date_gmt":"2018-12-18T13:40:31","guid":{"rendered":"http:\/\/smart--grid.net\/?page_id=6765"},"modified":"2022-12-03T23:02:04","modified_gmt":"2022-12-03T22:02:04","slug":"parcours-recherche-automate-stochastique-2018-2019","status":"publish","type":"page","link":"https:\/\/complex-systems-ai.com\/es\/proceso-de-markov\/estocastico-automata-ruta-de-investigacion-2018-2019\/","title":{"rendered":"Ruta de investigaci\u00f3n: aut\u00f3mata estoc\u00e1stico (2018-2019)"},"content":{"rendered":"\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\ud83d\udd17 Proyecto<\/a><\/td>\n<\/td>\n<\/td>\n<\/tr>\n
<\/td>\n<\/tr>\n
<\/td>\n<\/tr>\n
Sesi\u00f3n<\/strong><\/span><\/td>\nLeer<\/strong><\/span><\/td>\nIdea \/ Concepto<\/strong><\/span><\/td>\n<\/tr>\n
1<\/td>\n\ud83d\udd17 Lectura 1<\/a><\/td>\nLo esencial<\/em><\/span><\/strong><\/td>\n<\/tr>\n
     \u2192 Probabilidad<\/em><\/td>\n<\/tr>\n
     \u2192 Variable aleatoria<\/em><\/td>\n<\/tr>\n
     \u2192 cadena de Markov<\/a> tiempo discreto orden 1<\/em><\/td>\n<\/tr>\n
     \u2192 Teorema erg\u00f3dico<\/a><\/em><\/td>\n<\/tr>\n
     \u2192 Absorci\u00f3n<\/em><\/td>\n<\/tr>\n
     \u2192 Estudio de una cadena<\/em><\/td>\n<\/tr>\n
2<\/td>\n\ud83d\udd17 Lectura 2<\/a><\/td>\nCadena de Markov oculta<\/em><\/strong><\/td>\n<\/tr>\n
     \u2192 Definiciones<\/em><\/td>\n<\/tr>\n
     \u2192 Hacia atr\u00e1s-adelante<\/em><\/td>\n<\/tr>\n
     \u2192 Viterbi<\/em><\/td>\n<\/tr>\n
     \u2192 Baum-Welch<\/em><\/td>\n<\/tr>\n
     \u2192 sklearn<\/em><\/td>\n<\/tr>\n
3<\/td>\n\ud83d\udd17 Lectura 3<\/a><\/td>\nAut\u00f3mata probabil\u00edstico<\/em><\/strong><\/td>\n<\/tr>\n
     \u2192 Aut\u00f3mata<\/a> probabil\u00edstico<\/em><\/td>\n<\/tr>\n
     \u2192 Aut\u00f3mata de frecuencia<\/em><\/td>\n<\/tr>\n
     \u2192 HMMT<\/em><\/td>\n<\/tr>\n
     \u2192 Combinar y doblar<\/em><\/td>\n<\/tr>\n
     \u2192 palabras prohibidas<\/em><\/td>\n<\/tr>\n
     \u2192 ALERGIA<\/em><\/td>\n<\/tr>\n
<\/td>\n<\/td>\n<\/td>\n<\/tr>\n
<\/td>\n<\/tr>\n
                     REFERENCIAS<\/strong><\/span><\/td>\n<\/tr>\n
Introducci\u00f3n a los algoritmos<\/em><\/strong>: Cormen, T y Leiserson, C<\/td>\n<\/tr>\n
El manual de dise\u00f1o de algoritmos<\/em><\/strong>: Steven S. Skiena<\/td>\n<\/tr>\n
Inferencia gramatical: aprendizaje de aut\u00f3matas y gram\u00e1ticas<\/em><\/strong>: C. de la Higuera<\/td>\n<\/tr>\n<\/tbody>\n<\/table>","protected":false},"excerpt":{"rendered":"

\ud83d\udd17 Sesi\u00f3n de proyecto Clase Idea\/Concepto 1 \ud83d\udd17 Clase 1 Conceptos b\u00e1sicos \u2192 Probabilidad \u2192 Variable aleatoria \u2192 Orden de tiempo discreto de la cadena de Markov... <\/p>","protected":false},"author":1,"featured_media":0,"parent":5007,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-6765","page","type-page","status-publish","hentry"],"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/pages\/6765","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/comments?post=6765"}],"version-history":[{"count":5,"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/pages\/6765\/revisions"}],"predecessor-version":[{"id":18695,"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/pages\/6765\/revisions\/18695"}],"up":[{"embeddable":true,"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/pages\/5007"}],"wp:attachment":[{"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/media?parent=6765"}],"curies":[{"name":"gracias","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}