. . "A queue machine, queue automaton, or pullup automaton (PUA) is a finite state machine with the ability to store and retrieve data from an infinite-memory queue. It is a model of computation equivalent to a Turing machine, and therefore it can process the same class of formal languages."@en . . . . "6249"^^ . "En informatique th\u00E9orique, et notamment en th\u00E9orie des automates, un automate \u00E0 file (en anglais \u00AB queue automaton \u00BB) est un automate fini dot\u00E9 d\u2019une m\u00E9moire auxiliaire infinie organis\u00E9e en file. C\u2019est un mod\u00E8le de calcul qui est \u00E9quivalent aux machines de Turing, et accepte donc la m\u00EAme classe de langages. En cela, ce mod\u00E8le diff\u00E8re des automates \u00E0 pile qui ne reconnaissent que les langages alg\u00E9briques. Autant les automates \u00E0 pile op\u00E8rent en mode last in, first out (LIFO), un automate \u00E0 file travaille en mode first in, first out (FIFO)."@fr . . . . . . . . . . . . . . "Uma m\u00E1quina com fila ou aut\u00F4mato com fila \u00E9 uma m\u00E1quina de estado finito com a habilidade de armazenar e recuperar dados a partir de uma fila de mem\u00F3ria infinita. \u00C9 um modelo de computa\u00E7\u00E3o equivalente a uma m\u00E1quina de Turing, e, portanto, ele pode processar qualquer linguagem formal."@pt . "Queue automaton"@en . . . "1118682208"^^ . "A queue machine, queue automaton, or pullup automaton (PUA) is a finite state machine with the ability to store and retrieve data from an infinite-memory queue. It is a model of computation equivalent to a Turing machine, and therefore it can process the same class of formal languages."@en . "14098258"^^ . "En informatique th\u00E9orique, et notamment en th\u00E9orie des automates, un automate \u00E0 file (en anglais \u00AB queue automaton \u00BB) est un automate fini dot\u00E9 d\u2019une m\u00E9moire auxiliaire infinie organis\u00E9e en file. C\u2019est un mod\u00E8le de calcul qui est \u00E9quivalent aux machines de Turing, et accepte donc la m\u00EAme classe de langages. En cela, ce mod\u00E8le diff\u00E8re des automates \u00E0 pile qui ne reconnaissent que les langages alg\u00E9briques. Autant les automates \u00E0 pile op\u00E8rent en mode last in, first out (LIFO), un automate \u00E0 file travaille en mode first in, first out (FIFO)."@fr . . . . "Aut\u00F4mato com fila"@pt . . . . . . . "Automate \u00E0 file"@fr . . . . "Uma m\u00E1quina com fila ou aut\u00F4mato com fila \u00E9 uma m\u00E1quina de estado finito com a habilidade de armazenar e recuperar dados a partir de uma fila de mem\u00F3ria infinita. \u00C9 um modelo de computa\u00E7\u00E3o equivalente a uma m\u00E1quina de Turing, e, portanto, ele pode processar qualquer linguagem formal."@pt . .