. . "Aut\u00F2mat per subprocessos"@ca . . . . . . . . . "Thread automaton"@en . "En teoria d'aut\u00F2mats, un aut\u00F2mat per subprocessos \u00E9s un tipus est\u00E8s d'una m\u00E0quina d'estats finita que reconeix un ."@ca . . . . . . "En teoria d'aut\u00F2mats, un aut\u00F2mat per subprocessos \u00E9s un tipus est\u00E8s d'una m\u00E0quina d'estats finita que reconeix un ."@ca . . . . . "950905337"^^ . . . . . . "4321"^^ . . . . . . . "37721302"^^ . . . . . "In automata theory, the thread automaton (plural: automata) is an extended type of finite-state automata that recognizes a mildly context-sensitive language class above the tree-adjoining languages."@en . "In automata theory, the thread automaton (plural: automata) is an extended type of finite-state automata that recognizes a mildly context-sensitive language class above the tree-adjoining languages."@en . .