. . . "En informatique th\u00E9orique et en logique math\u00E9matique, un syst\u00E8me de Post, ou syst\u00E8me canonique de Post, appel\u00E9 ainsi d\u2019apr\u00E8s son cr\u00E9ateur Emil Post, est un syst\u00E8me de manipulation de cha\u00EEnes de caract\u00E8res qui commence avec un nombre fini de mots et les transforme par application d\u2019un ensemble fini de r\u00E8gles d\u2019un forme particuli\u00E8re, et par l\u00E0 engendre un langage formel. Ces syst\u00E8me ont surtout un int\u00E9r\u00EAt historique car tout syst\u00E8me de Post peut \u00EAtre r\u00E9duit \u00E0 un syst\u00E8me de r\u00E9\u00E9criture de mots (un syst\u00E8me de semi-Thue) qui est une formulation plus simple. Les deux formalismes -- syst\u00E8me de Post et r\u00E9\u00E9criture -- sont Turing-complets."@fr . . "13995373"^^ . "5018"^^ . . "Syst\u00E8me de Post"@fr . "\u0427\u0438\u0441\u043B\u0435\u043D\u043D\u044F \u041F\u043E\u0441\u0442\u0430 \u2014 \u043A\u043B\u0430\u0441 \u0447\u0438\u0441\u043B\u0435\u043D\u044C, \u044F\u043A\u0438\u0439 \u0437\u0430\u043F\u0440\u043E\u043F\u043E\u043D\u0443\u0432\u0430\u0432 \u0430\u043C\u0435\u0440\u0438\u043A\u0430\u043D\u0441\u044C\u043A\u0438\u0439 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u043A \u0415\u043C\u0456\u043B\u044C \u041F\u043E\u0441\u0442. \u0427\u0438\u0441\u043B\u0435\u043D\u043D\u044F \u041F\u043E\u0441\u0442\u0430 \u043C\u043E\u0436\u043D\u0430 \u0440\u043E\u0437\u0433\u043B\u044F\u0434\u0430\u0442\u0438 \u044F\u043A \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u0447\u043D\u0435 \u0443\u0442\u043E\u0447\u043D\u0435\u043D\u043D\u044F \u0456\u043D\u0442\u0443\u0457\u0442\u0438\u0432\u043D\u043E\u0433\u043E \u043F\u043E\u043D\u044F\u0442\u0442\u044F \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C\u0443."@uk . "Sistema can\u00F4nico de Post"@pt . "Post canonical system"@en . . "\u0427\u0438\u0441\u043B\u0435\u043D\u043D\u044F \u041F\u043E\u0441\u0442\u0430"@uk . . . . . . . . . "En informatique th\u00E9orique et en logique math\u00E9matique, un syst\u00E8me de Post, ou syst\u00E8me canonique de Post, appel\u00E9 ainsi d\u2019apr\u00E8s son cr\u00E9ateur Emil Post, est un syst\u00E8me de manipulation de cha\u00EEnes de caract\u00E8res qui commence avec un nombre fini de mots et les transforme par application d\u2019un ensemble fini de r\u00E8gles d\u2019un forme particuli\u00E8re, et par l\u00E0 engendre un langage formel. Ces syst\u00E8me ont surtout un int\u00E9r\u00EAt historique car tout syst\u00E8me de Post peut \u00EAtre r\u00E9duit \u00E0 un syst\u00E8me de r\u00E9\u00E9criture de mots (un syst\u00E8me de semi-Thue) qui est une formulation plus simple. Les deux formalismes -- syst\u00E8me de Post et r\u00E9\u00E9criture -- sont Turing-complets."@fr . . . . . . . . . . . "A Post canonical system, also known as a Post production system, as created by Emil Post, is a string-manipulation system that starts with finitely-many strings and repeatedly transforms them by applying a finite set j of specified rules of a certain form, thus generating a formal language. Today they are mainly of historical relevance because every Post canonical system can be reduced to a string rewriting system (semi-Thue system), which is a simpler formulation. Both formalisms are Turing complete."@en . . . . . . . . . . . "1029956360"^^ . "Um sistema can\u00F4nico de Post \u00E9 uma tripla (A,I,R), onde \n* A \u00E9 um alfabeto finito, e finitas (possivelmente vazias) cadeias em A s\u00E3o chamadas palavras. \n* I \u00E9 um conjunto finito de palavras iniciais. \n* R \u00E9 um conjunto finito de regras de transforma\u00E7\u00E3o de cadeias (chamadas regras de produ\u00E7\u00E3o), cada regra sendo da seguinte forma: onde cada g e h \u00E9 uma palavra fixa espec\u00EDfica, e cada $ e $' \u00E9 uma vari\u00E1vel servindo como uma palavra arbitr\u00E1ria. As cadeias antes e depois da seta em uma regra de produ\u00E7\u00E3o s\u00E3o chamadas os antecedentes e consequentes da regra, respectivamente. \u00C9 preciso que cada $' nos consequentes seja um dos $s nos antecedentes desta regra, e cada antecedente e consequente conterem ao menos uma vari\u00E1vel. Em v\u00E1rios contextos, cada regra de produ\u00E7\u00E3o tem apenas um antecedente, tomando a forma mais simples A linguagem formal gerada por um sistema can\u00F4nico de Post \u00E9 o conjunto cujos elementos s\u00E3o as palavras iniciais juntas com todas as palavras obten\u00EDveis a partir delas atrav\u00E9s da aplica\u00E7\u00E3o repetida das regras de produ\u00E7\u00E3o. Tais conjuntos s\u00E3o recursivamente enumer\u00E1veis e toda linguagem recursivamente enumer\u00E1vel \u00E9 a restri\u00E7\u00E3o de algum conjunto deste tipo para um sub-alfabeto de A."@pt . . . "A Post canonical system, also known as a Post production system, as created by Emil Post, is a string-manipulation system that starts with finitely-many strings and repeatedly transforms them by applying a finite set j of specified rules of a certain form, thus generating a formal language. Today they are mainly of historical relevance because every Post canonical system can be reduced to a string rewriting system (semi-Thue system), which is a simpler formulation. Both formalisms are Turing complete."@en . . . . . "\u0427\u0438\u0441\u043B\u0435\u043D\u043D\u044F \u041F\u043E\u0441\u0442\u0430 \u2014 \u043A\u043B\u0430\u0441 \u0447\u0438\u0441\u043B\u0435\u043D\u044C, \u044F\u043A\u0438\u0439 \u0437\u0430\u043F\u0440\u043E\u043F\u043E\u043D\u0443\u0432\u0430\u0432 \u0430\u043C\u0435\u0440\u0438\u043A\u0430\u043D\u0441\u044C\u043A\u0438\u0439 \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u043A \u0415\u043C\u0456\u043B\u044C \u041F\u043E\u0441\u0442. \u0427\u0438\u0441\u043B\u0435\u043D\u043D\u044F \u041F\u043E\u0441\u0442\u0430 \u043C\u043E\u0436\u043D\u0430 \u0440\u043E\u0437\u0433\u043B\u044F\u0434\u0430\u0442\u0438 \u044F\u043A \u043C\u0430\u0442\u0435\u043C\u0430\u0442\u0438\u0447\u043D\u0435 \u0443\u0442\u043E\u0447\u043D\u0435\u043D\u043D\u044F \u0456\u043D\u0442\u0443\u0457\u0442\u0438\u0432\u043D\u043E\u0433\u043E \u043F\u043E\u043D\u044F\u0442\u0442\u044F \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C\u0443."@uk . . "Um sistema can\u00F4nico de Post \u00E9 uma tripla (A,I,R), onde \n* A \u00E9 um alfabeto finito, e finitas (possivelmente vazias) cadeias em A s\u00E3o chamadas palavras. \n* I \u00E9 um conjunto finito de palavras iniciais. \n* R \u00E9 um conjunto finito de regras de transforma\u00E7\u00E3o de cadeias (chamadas regras de produ\u00E7\u00E3o), cada regra sendo da seguinte forma: Em v\u00E1rios contextos, cada regra de produ\u00E7\u00E3o tem apenas um antecedente, tomando a forma mais simples"@pt .