@prefix rdf: . @prefix dbpedia: . @prefix ns2: . dbpedia:Tag_system rdf:type ns2:ComputationalModels . @prefix owl: . dbpedia:Tag_system owl:sameAs . @prefix foaf: . @prefix ns5: . dbpedia:Tag_system foaf:page ns5:Tag_system . @prefix rdfs: . dbpedia:Tag_system rdfs:label "\u30BF\u30B0\u30B7\u30B9\u30C6\u30E0"@ja , "M\u00E1quina de Post"@es , "Tag system"@en , "\u6807\u8BB0\u7CFB\u7EDF"@zh . @prefix dbpprop: . dbpedia:Tag_system dbpprop:abstract "\u6807\u8BB0\u7CFB\u7EDF\u662F Emil Leon Post \u57281943\u5E74\u521B\u7ACB\u7684\u786E\u5B9A\u6027\u8BA1\u7B97\u6A21\u578B\uFF0C\u4F5C\u4E3A\u4E00\u79CD\u7B80\u5355\u5F62\u5F0F\u7684\u5B57\u7B26\u4E32\u91CD\u5199\u7CFB\u7EDF\u3002\u6807\u8BB0\u7CFB\u7EDF\u4E5F\u53EF\u4EE5\u770B\u4F5C\u62BD\u8C61\u673A\uFF0C\u53EB\u505A Post \u6807\u8BB0\u673A\uFF08\u4E0D\u8981\u6DF7\u6DC6\u4E8EPost-\u56FE\u7075\u673A\uFF09-- \u7B80\u5355\u7684\u8BF4\uFF0C\u5176\u552F\u4E00\u7684\u78C1\u5E26\u662F\u65E0\u9650\u957F\u5EA6\u7684 FIFO \u961F\u5217\u7684\u6709\u9650\u72B6\u6001\u81EA\u52A8\u673A\uFF0C\u5728\u6BCF\u6B21\u72B6\u6001\u8F6C\u53D8\u4E2D\u673A\u5668\u8BFB\u5728\u961F\u5217\u5934\u90E8\u7684\u7B26\u53F7\uFF0C\u4ECE\u5934\u90E8\u5220\u9664\u56FA\u5B9A\u6570\u76EE\u7684\u7B26\u53F7\uFF0C\u5E76\u53EF\u4EE5\u5411\u5C3E\u90E8\u589E\u52A0\u7B26\u53F7\u3002"@zh , "En Teor\u00EDa de la computaci\u00F3n y Teor\u00EDa de la recursi\u00F3n, una m\u00E1quina de Post, bautizada as\u00ED en honor de Emil Leon Post, es una aut\u00F3mata determinista con una cola. No hay cinta de lectura separada. Al principio del c\u00F3mputo, la cadena de entrada x es cargada en la cola. La cadena de entrada es seguida por un s\u00EDmbolo especial de fin de entrada. Al iniciarse el c\u00F3mputo, la cola s\u00F3lo contiene la configuraci\u00F3n de entrada. El primer s\u00EDmbolo de x est\u00E1 al principio de la cola y el s\u00EDmbolo de final de entrada est\u00E1 luego del \u00FAltimo car\u00E1cter. Una m\u00E1quina de transici\u00F3n de Post depende del s\u00EDmbolo al frente de la cola y del estado. Cada transici\u00F3n borrar\u00E1 el s\u00EDmbolo al principio de la cola. Una transici\u00F3n tiene dos componentes: el pr\u00F3ximo estado y una cadena que se inserta al final de la cola. La cadena puede ser vac\u00EDa."@es , "\u30BF\u30B0\u30B7\u30B9\u30C6\u30E0\uFF08\u82F1: Tag system\uFF09\u306F\u30011943\u5E74\u306B\u30A8\u30DF\u30FC\u30EB\u30FB\u30DD\u30B9\u30C8\u304C\u767A\u8868\u3057\u305F\u6C7A\u5B9A\u6027\u8A08\u7B97\u6A21\u578B\u306E\u4E00\u7A2E\u3067\u3042\u308A\u3001\u30DD\u30B9\u30C8\u6B63\u6E96\u7CFB\u306E\u3054\u304F\u5358\u7D14\u306A\u5F62\u5F0F\u306E\u3082\u306E\u3067\u3042\u308B\u3002\u30BF\u30B0\u30B7\u30B9\u30C6\u30E0\u3092\u62BD\u8C61\u6A5F\u68B0\u3068\u307F\u306A\u3057\u305F\u5834\u5408\u3001\u30DD\u30B9\u30C8\u30BF\u30B0\u6A5F\u68B0\uFF08Post Tag Machine\u3001PTM\uFF09\u3068\u3082\u547C\u3076\u3002\u5927\u307E\u304B\u306B\u8A00\u3048\u3070\u3001\u7121\u9650\u9577\u306EFIFO\u30AD\u30E5\u30FC\u3068\u3057\u3066\u306E\u30C6\u30FC\u30D7\u88C5\u7F6E\u3092\u6301\u3063\u305F\u6709\u9650\u72B6\u614B\u6A5F\u68B0\u3067\u3042\u308A\u3001\u72B6\u614B\u9077\u79FB\u306E\u305F\u3073\u306B\u30C6\u30FC\u30D7\u306E\u30D8\u30C3\u30C9\u4F4D\u7F6E\u304B\u3089\u8A18\u53F7\u3092\u8AAD\u307F\u53D6\u308A\u3001\u30D8\u30C3\u30C9\u4F4D\u7F6E\u304B\u3089\u56FA\u5B9A\u500B\u306E\u8A18\u53F7\u3092\u6D88\u53BB\u3057\u3001\u6700\u5F8C\u5C3E\u306B\u8A18\u53F7\u3092\u8FFD\u52A0\u3059\u308B\u3002"@ja , "A tag system is a deterministic computational model published by Emil Leon Post in 1943 as a simple form of Post canonical system A tag system may also be viewed as an abstract machine, called a Post tag machine (not to be confused with Post-Turing machines)\u2014briefly, a finite state machine whose only tape is a FIFO queue of unbounded length, such that in each transition the machine reads the symbol at the head of the queue, deletes a fixed number of symbols from the head, and to the tail appends a symbol-string preassigned to the deleted symbol (Because all of the indicated operations are performed in each transition, a tag machine strictly has only one state)"@en ; rdfs:comment "\u6807\u8BB0\u7CFB\u7EDF\u662F Emil Leon Post \u57281943\u5E74\u521B\u7ACB\u7684\u786E\u5B9A\u6027\u8BA1\u7B97\u6A21\u578B\uFF0C\u4F5C\u4E3A\u4E00\u79CD\u7B80\u5355\u5F62\u5F0F\u7684\u5B57\u7B26\u4E32\u91CD\u5199\u7CFB\u7EDF\u3002\u6807\u8BB0\u7CFB\u7EDF\u4E5F\u53EF\u4EE5\u770B\u4F5C\u62BD\u8C61\u673A\uFF0C\u53EB\u505A Post \u6807\u8BB0\u673A\uFF08\u4E0D\u8981\u6DF7\u6DC6\u4E8EPost-\u56FE\u7075\u673A\uFF09-- \u7B80\u5355\u7684\u8BF4\uFF0C\u5176\u552F\u4E00\u7684\u78C1\u5E26\u662F\u65E0\u9650\u957F\u5EA6\u7684 FIFO \u961F\u5217\u7684\u6709\u9650\u72B6\u6001\u81EA\u52A8\u673A\uFF0C\u5728\u6BCF\u6B21\u72B6\u6001\u8F6C\u53D8\u4E2D\u673A\u5668\u8BFB\u5728\u961F\u5217\u5934\u90E8\u7684\u7B26\u53F7\uFF0C\u4ECE\u5934\u90E8\u5220\u9664\u56FA\u5B9A\u6570\u76EE\u7684\u7B26\u53F7\uFF0C\u5E76\u53EF\u4EE5\u5411\u5C3E\u90E8\u589E\u52A0\u7B26\u53F7\u3002"@zh , ""@ja , ""@en , "En Teor\u00EDa de la computaci\u00F3n y Teor\u00EDa de la recursi\u00F3n, una m\u00E1quina de Post, bautizada as\u00ED en honor de Emil Leon Post, es una aut\u00F3mata determinista con una cola. No hay cinta de lectura separada. Al principio del c\u00F3mputo, la cadena de entrada x es cargada en la cola. La cadena de entrada es seguida por un s\u00EDmbolo especial de fin de entrada. Al iniciarse el c\u00F3mputo, la cola s\u00F3lo contiene la configuraci\u00F3n de entrada."@es . @prefix skos: . @prefix ns9: . dbpedia:Tag_system skos:subject ns9:Computational_models . @prefix ns10: . dbpedia:Tag_system dbpprop:hasPhotoCollection ns10:Tag_system . dbpedia:Tag dbpprop:disambiguates dbpedia:Tag_system . dbpedia:Post_Machine dbpprop:redirect dbpedia:Tag_system . dbpedia:Tag_systems dbpprop:redirect dbpedia:Tag_system . @prefix yago: . yago:Tag_system owl:sameAs dbpedia:Tag_system .