{"id":619,"date":"2019-10-06T16:52:00","date_gmt":"2019-10-06T12:52:00","guid":{"rendered":"https:\/\/iremi.univ-reunion.fr\/?p=619"},"modified":"2025-06-27T19:18:03","modified_gmt":"2025-06-27T15:18:03","slug":"automates-et-apprentissage-de-la-lecture","status":"publish","type":"post","link":"https:\/\/iremi.univ-reunion.fr\/?p=619","title":{"rendered":"Automates et apprentissage de la lecture"},"content":{"rendered":"\n<p>Un automate est un graphe \u00e9tiquet\u00e9 par des lettres, il permet de dessiner les liens entre les lettres (qui se suivent s&rsquo;il y a une fl\u00e8che entre elles). On distingue deux sortes d&rsquo;automates :<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Automates de Kleene<\/h2>\n\n\n\n<p>Un pion (ou un \u00e9l\u00e8ve si le graphe est suffisamment grand) se balade sur un graphe, en suivant les fl\u00e8ches. Dans le trajet qu&rsquo;il a choisi, il r\u00e9colte des lettres. Ces lettres forment un mot.<\/p>\n\n\n\n<p>Deux activit\u00e9s ont \u00e9t\u00e9 test\u00e9es en GS et en CP :<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>parcourir un automate en r\u00e9coltant les lettres, formant ainsi un pr\u00e9nom (dont celui de l&rsquo;enfant),<\/li>\n\n\n\n<li>suivre un parcours dans un automate binaire (lettres 0 ou 1) et regarder si le mot est reconnu ou non par l&rsquo;automate.<\/li>\n<\/ul>\n\n\n\n<p>Voici le bilan de l&rsquo;activit\u00e9 en GS :<\/p>\n\n\n\n<div data-wp-interactive=\"core\/file\" class=\"wp-block-file\"><object data-wp-bind--hidden=\"!state.hasPdfPreview\" hidden class=\"wp-block-file__embed\" data=\"https:\/\/iremi.univ-reunion.fr\/wp-content\/uploads\/2019\/10\/automatesKleeneGS.pdf\" type=\"application\/pdf\" style=\"width:100%;height:600px\" aria-label=\"Contenu embarqu\u00e9 automatesKleeneGS.\"><\/object><a id=\"wp-block-file--media-e61d0251-bf0c-422d-b3d7-52935993d790\" href=\"https:\/\/iremi.univ-reunion.fr\/wp-content\/uploads\/2019\/10\/automatesKleeneGS.pdf\">automatesKleeneGS<\/a><a href=\"https:\/\/iremi.univ-reunion.fr\/wp-content\/uploads\/2019\/10\/automatesKleeneGS.pdf\" class=\"wp-block-file__button wp-element-button\" download aria-describedby=\"wp-block-file--media-e61d0251-bf0c-422d-b3d7-52935993d790\">T\u00e9l\u00e9charger<\/a><\/div>\n\n\n\n<p>Pour la reconnaissance de mots binaires, on a propos\u00e9 une enqu\u00eate polici\u00e8re :<\/p>\n\n\n\n<blockquote class=\"wp-block-quote is-layout-flow wp-block-quote-is-layout-flow\">\n<p>Le mot compos\u00e9 de chiffres 0 et 1 r\u00e9sume le trajet d&rsquo;un suspect. Au moment indiqu\u00e9 par la fin du mot, un incident est arriv\u00e9 au lieu indiqu\u00e9 par le cercle d\u00e9doubl\u00e9 (point de d\u00e9part du suspect). Chercher \u00e0 l&rsquo;aide du mot, si le suspect est innocent\u00e9 parce que loin du lieu de l&rsquo;incident.<\/p>\n<\/blockquote>\n\n\n\n<p>Lors de la f\u00eate de la science 2019 (activit\u00e9 anim\u00e9e par les \u00e9l\u00e8ves de l&rsquo;Alefpa), la plus jeune d\u00e9tective avait un niveau PS (\u00e2g\u00e9e de 2 ans).<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Automates transducteurs<\/h2>\n\n\n\n<p>Un automate de Mealy ne se contente pas de lire des mots, ils en \u00e9crit aussi : \u00e0 chaque parcours d&rsquo;une fl\u00e8che, on ramasse une carte portant au recto la lettre d\u00e9terminant l&rsquo;ar\u00eate parcourue, et au verso une autre lettre (parfois) que l&rsquo;on dicte \u00e0 un complice qui \u00e9crit, au fur et \u00e0 mesure, les lettres d\u00e9couvertes. Cela forme un mot que l&rsquo;on a ainsi d\u00e9chiffr\u00e9. Avec cet automate<\/p>\n\n\n\n<div data-wp-interactive=\"core\/file\" class=\"wp-block-file\"><object data-wp-bind--hidden=\"!state.hasPdfPreview\" hidden class=\"wp-block-file__embed\" data=\"https:\/\/iremi.univ-reunion.fr\/wp-content\/uploads\/2019\/10\/huffmann1.pdf\" type=\"application\/pdf\" style=\"width:100%;height:600px\" aria-label=\"Contenu embarqu\u00e9 huffmann1.\"><\/object><a id=\"wp-block-file--media-314a559a-268f-4b5f-9b84-1e4e263b99d1\" href=\"https:\/\/iremi.univ-reunion.fr\/wp-content\/uploads\/2019\/10\/huffmann1.pdf\">huffmann1<\/a><a href=\"https:\/\/iremi.univ-reunion.fr\/wp-content\/uploads\/2019\/10\/huffmann1.pdf\" class=\"wp-block-file__button wp-element-button\" download aria-describedby=\"wp-block-file--media-314a559a-268f-4b5f-9b84-1e4e263b99d1\">T\u00e9l\u00e9charger<\/a><\/div>\n\n\n\n<p>on peut d\u00e9coder certains mots cod\u00e9s, par exemple ceux-ci :<\/p>\n\n\n\n<div data-wp-interactive=\"core\/file\" class=\"wp-block-file\"><object data-wp-bind--hidden=\"!state.hasPdfPreview\" hidden class=\"wp-block-file__embed\" data=\"https:\/\/iremi.univ-reunion.fr\/wp-content\/uploads\/2019\/10\/huffmann0.pdf\" type=\"application\/pdf\" style=\"width:100%;height:600px\" aria-label=\"Contenu embarqu\u00e9 huffmann0.\"><\/object><a id=\"wp-block-file--media-ee8832f0-3adb-43fd-9c19-5190034446bc\" href=\"https:\/\/iremi.univ-reunion.fr\/wp-content\/uploads\/2019\/10\/huffmann0.pdf\">huffmann0<\/a><a href=\"https:\/\/iremi.univ-reunion.fr\/wp-content\/uploads\/2019\/10\/huffmann0.pdf\" class=\"wp-block-file__button wp-element-button\" download aria-describedby=\"wp-block-file--media-ee8832f0-3adb-43fd-9c19-5190034446bc\">T\u00e9l\u00e9charger<\/a><\/div>\n\n\n\n<p>L&rsquo;activit\u00e9 a beaucoup plu aux \u00e9l\u00e8ves de l&rsquo;Alefpa, qui sont all\u00e9s jusqu&rsquo;\u00e0 cr\u00e9er leur propre automate de cryptographie !<\/p>\n\n\n\n<p>La crise Covid a emp\u00each\u00e9 de mener plus loin l&rsquo;exp\u00e9rience et le temps a manqu\u00e9 pour savoir quel impact \u00e9ventuel ce genre d&rsquo;activit\u00e9 peut avoir sur l&rsquo;apprentissage de la lecture et de l&rsquo;\u00e9criture.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Un automate est un graphe \u00e9tiquet\u00e9 par des lettres, il permet de dessiner les liens entre les lettres (qui se suivent s&rsquo;il y a une fl\u00e8che entre elles). On distingue deux sortes d&rsquo;automates : Automates de Kleene Un pion (ou un \u00e9l\u00e8ve si le graphe est suffisamment grand) se balade sur un graphe, en suivant [&hellip;]<\/p>\n","protected":false},"author":6,"featured_media":1067,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[9,3,6],"tags":[73,28,29,76,70],"coauthors":[54],"class_list":["post-619","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-algorithmes-programmation-et-langages","category-arithmetique-et-algebre","category-continuum-des-apprentissages","tag-automate","tag-cycle-1","tag-cycle-2","tag-eleves-a-besoin-particulier","tag-maternelle"],"_links":{"self":[{"href":"https:\/\/iremi.univ-reunion.fr\/index.php?rest_route=\/wp\/v2\/posts\/619","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/iremi.univ-reunion.fr\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/iremi.univ-reunion.fr\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/iremi.univ-reunion.fr\/index.php?rest_route=\/wp\/v2\/users\/6"}],"replies":[{"embeddable":true,"href":"https:\/\/iremi.univ-reunion.fr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=619"}],"version-history":[{"count":3,"href":"https:\/\/iremi.univ-reunion.fr\/index.php?rest_route=\/wp\/v2\/posts\/619\/revisions"}],"predecessor-version":[{"id":686,"href":"https:\/\/iremi.univ-reunion.fr\/index.php?rest_route=\/wp\/v2\/posts\/619\/revisions\/686"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/iremi.univ-reunion.fr\/index.php?rest_route=\/wp\/v2\/media\/1067"}],"wp:attachment":[{"href":"https:\/\/iremi.univ-reunion.fr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=619"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/iremi.univ-reunion.fr\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=619"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/iremi.univ-reunion.fr\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=619"},{"taxonomy":"author","embeddable":true,"href":"https:\/\/iremi.univ-reunion.fr\/index.php?rest_route=%2Fwp%2Fv2%2Fcoauthors&post=619"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}