. "Un aut\u00F2mat linealment acotat , abreujadament LBA (de l'angl\u00E8s, Linear bounded automaton ), o ALA \u00E9s un aut\u00F2mat similar a una m\u00E0quina de Turing determinista."@ca . . "1811962"^^ . . "Eine linear beschr\u00E4nkte Turingmaschine (auch LBA = Linear Bounded Automaton) in der Theoretischen Informatik ist eine Turingmaschine, die den Bereich des Bandes, auf dem die Eingabe steht, w\u00E4hrend der gesamten Berechnung nicht verl\u00E4sst."@de . "1066171258"^^ . . . "\u7EBF\u6027\u6709\u754C\u81EA\u52A8\u673A\uFF08\u82F1\u6587\uFF1ALinear bounded automaton\uFF0C\u7B80\u5199\uFF1A LBA\uFF09\u662F\u53D7\u9650\u5F62\u5F0F\u7684\u975E\u786E\u5B9A\u56FE\u7075\u673A\u3002\u5B83\u62E5\u6709\u7531\u5305\u542B\u6765\u81EA\u6709\u9650\u5B57\u6BCD\u8868\u7684\u7B26\u53F7\u7684\u5355\u5143\u6784\u6210\u7684\u78C1\u5E26\uFF0C\u53EF\u4EE5\u4E00\u6B21\u8BFB\u53D6\u548C\u5199\u5165\u78C1\u5E26\u4E0A\u4E00\u4E2A\u5355\u5143\u7684\u5E76\u53EF\u4EE5\u79FB\u52A8\u7684\u78C1\u5934\uFF0C\u548C\u6709\u9650\u6570\u76EE\u4E2A\u72B6\u6001\u3002\u5B83\u533A\u522B\u4E8E\u66F4\u4E3A\u666E\u904D\u7684\u56FE\u7075\u673A\u5728\u4E8E\u5C3D\u7BA1\u78C1\u5E26\u6700\u521D\u88AB\u8BA4\u4E3A\u662F\u65E0\u9650\u7684\uFF0C\u53EA\u6709\u5176\u957F\u5EA6\u662F\u521D\u59CB\u8F93\u5165\u7684\u7EBF\u6027\u51FD\u6570\u7684\u6709\u9650\u4E34\u8FD1\u90E8\u5206\u53EF\u4EE5\u88AB\u8BFB\u5199\u78C1\u5934\u8BBF\u95EE\u3002\u8FD9\u4E2A\u9650\u5236\u4F7F LBA \u6210\u4E3A\u5728\u67D0\u4E9B\u65B9\u9762\u6BD4\u56FE\u7075\u673A\u66F4\u63A5\u8FD1\u5B9E\u9645\u5B58\u5728\u7684\u8BA1\u7B97\u673A\u7684\u7CBE\u786E\u6A21\u578B\u3002"@zh . . "Un aut\u00F2mat linealment acotat , abreujadament LBA (de l'angl\u00E8s, Linear bounded automaton ), o ALA \u00E9s un aut\u00F2mat similar a una m\u00E0quina de Turing determinista."@ca . . "\u7EBF\u6027\u6709\u754C\u81EA\u52A8\u673A"@zh . "Automa lineare limitato"@it . . "Aut\u00F3mata linealmente acotado"@es . "In computer science, a linear bounded automaton (plural linear bounded automata, abbreviated LBA) is a restricted form of Turing machine."@en . . . . "Eine linear beschr\u00E4nkte Turingmaschine (auch LBA = Linear Bounded Automaton) in der Theoretischen Informatik ist eine Turingmaschine, die den Bereich des Bandes, auf dem die Eingabe steht, w\u00E4hrend der gesamten Berechnung nicht verl\u00E4sst."@de . . . . "Um Aut\u00F4mato linearmente limitado \u00E9 uma M\u00E1quina de Turing com mem\u00F3ria limitada e \u00E9 o mecanismo reconhecedor de Linguagens sens\u00EDveis ao contexto. Sua fita \u00E9 limitada e portanto finita. Ele s\u00F3 consegue resolver problemas que usem uma quantidade de mem\u00F3ria que possa caber dentro da fita usada para entrada. Se por acaso utilizarmos um alfabeto de fita maior que o alfabeto de entrada ent\u00E3o teremos um incremento da mem\u00F3ria dispon\u00EDvel por at\u00E9 um fator constante, por isso se tivermos uma entrada de tamanho n a quantidade de mem\u00F3ria dispon\u00EDvel ser\u00E1 linear em rela\u00E7\u00E3o a n. Apesar de suas restri\u00E7\u00F5es os ALLs s\u00E3o bastantes potentes, podemos citar que os decisores para o problema da aceita\u00E7\u00E3o de um AFD para uma dada entrada, para o problema da vacuidade de um dado AFD, para o problema da aceita\u00E7\u00E3o de uma "@pt . . . . . "\uC120\uD615\uC720\uD55C \uC790\uB3D9 \uAE30\uACC4"@ko . "Un aut\u00F3mata linealmente acotado, abreviadamente LBA (del ingl\u00E9s, Linear Bounded Automaton),o ALA es un aut\u00F3mata similar a una m\u00E1quina de Turing determinista."@es . . . "Automate lin\u00E9airement born\u00E9"@fr . . . . "\uCEF4\uD4E8\uD130 \uACFC\uD559\uC5D0\uC11C \uC120\uD615\uC720\uD55C \uC790\uB3D9 \uAE30\uACC4(linear bounded automaton, LBA)\uB294 \uACC4\uC0B0 \uB2A5\uB825\uC744 \uC81C\uD55C\uD55C \uD29C\uB9C1 \uAE30\uACC4\uC758 \uC77C\uC885\uC774\uB2E4."@ko . "Automat liniowo ograniczony"@pl . . . "\u7DDA\u5F62\u62D8\u675F\u30AA\u30FC\u30C8\u30DE\u30C8\u30F3\uFF08\u305B\u3093\u3051\u3044\u3053\u3046\u305D\u304F\u30AA\u30FC\u30C8\u30DE\u30C8\u30F3\u3001Linear Bounded Automaton\uFF09\u306F\u3001\u5236\u9650\u3055\u308C\u305F\u30C1\u30E5\u30FC\u30EA\u30F3\u30B0\u30DE\u30B7\u30F3\u3067\u3042\u308B\u3002LBA \u3068\u7565\u8A18\u3055\u308C\u308B\u3002\u6709\u9650\u7A2E\u985E\u306E\u6587\u5B57\u3092\u4FDD\u6301\u3067\u304D\u308B\u30C6\u30FC\u30D7\u3068\u305D\u306E\u30C6\u30FC\u30D7\u306E\u8AAD\u307F\u66F8\u304D\u304C\u3067\u304D\u308B\u30D8\u30C3\u30C9\u3092\u6301\u3061\u3001\u6709\u9650\u6570\u306E\u72B6\u614B\u3092\u6301\u3064\u3002\u30C1\u30E5\u30FC\u30EA\u30F3\u30B0\u30DE\u30B7\u30F3\u3068\u7570\u306A\u308B\u306E\u306F LBA \u306E\u30C6\u30FC\u30D7\u9577\u304C\u6709\u9650\u3067\u3042\u308B\u3053\u3068\u3067\u3001\u305D\u306E\u9577\u3055\u306F\u30C6\u30FC\u30D7\u4E0A\u306E\u521D\u671F\u5165\u529B\u6587\u5B57\u5217\u306E\u9577\u3055\u306B\u6BD4\u4F8B\u3059\u308B\uFF08\u3064\u307E\u308A\u4E00\u6B21\u95A2\u6570\u3067\u3042\u308B\uFF09\u3002\u3053\u306E\u5236\u9650\u306B\u3088\u308A LBA \u306F\u3042\u308B\u610F\u5473\u3067\u306F\u30C1\u30E5\u30FC\u30EA\u30F3\u30B0\u30DE\u30B7\u30F3\u3088\u308A\u3082\u5B9F\u5728\u306E\u30B3\u30F3\u30D4\u30E5\u30FC\u30BF\u306E\u6B63\u78BA\u306A\u30E2\u30C7\u30EB\u3068\u8A00\u3048\u308B\u3002 \u7DDA\u5F62\u62D8\u675F\u30AA\u30FC\u30C8\u30DE\u30C8\u30F3\u306F\u6587\u8108\u4F9D\u5B58\u8A00\u8A9E\u3092\u53D7\u5BB9\u3059\u308B\u3002\u305D\u306E\u30AF\u30E9\u30B9\u306E\u8A00\u8A9E\u306E\u6587\u6CD5\u3067\u5236\u9650\u3055\u308C\u3066\u3044\u308B\u3053\u3068\u306F\u3001\u3042\u308B\u6587\u5B57\u5217\u304B\u3089\u77ED\u3044\u5225\u306E\u6587\u5B57\u5217\u3078\u306E\u30DE\u30C3\u30D4\u30F3\u30B0\u3092\u6301\u305F\u306A\u3044\u3053\u3068\u3067\u3042\u308B\u3002\u3057\u305F\u304C\u3063\u3066\u3001\u6587\u8108\u4F9D\u5B58\u6587\u6CD5\u306B\u3088\u3063\u3066\u751F\u6210\u3055\u308C\u308B\u6587\u5B57\u5217\u306F\u3001\u305D\u308C\u81EA\u8EAB\u3088\u308A\u9577\u3044\u6587\u578B\u3092\u5185\u5305\u3059\u308B\u3053\u3068\u304C\u3067\u304D\u306A\u3044\u3002\u7DDA\u5F62\u62D8\u675F\u30AA\u30FC\u30C8\u30DE\u30C8\u30F3\u3068\u6587\u8108\u4F9D\u5B58\u8A00\u8A9E\u306F\u4E00\u5BFE\u4E00\u306E\u5BFE\u5FDC\u95A2\u4FC2\u306B\u3042\u308B\u306E\u3067\u3001\u672C\u6765\u306E\u6587\u5B57\u5217\u304C\u66F8\u304B\u308C\u305F\u30C6\u30FC\u30D7\u306E\u9577\u3055\u304C\u3042\u308C\u3070\u3001\u305D\u306E\u30AA\u30FC\u30C8\u30DE\u30C8\u30F3\u306B\u7406\u89E3\u3067\u304D\u308B\u6587\u5B57\u5217\u306B\u306F\u5FC5\u8981\u5341\u5206\u3067\u3042\u308B\u3002"@ja . . . "Aut\u00F4mato linearmente limitado"@pt . "Un aut\u00F3mata linealmente acotado, abreviadamente LBA (del ingl\u00E9s, Linear Bounded Automaton),o ALA es un aut\u00F3mata similar a una m\u00E1quina de Turing determinista."@es . "\uCEF4\uD4E8\uD130 \uACFC\uD559\uC5D0\uC11C \uC120\uD615\uC720\uD55C \uC790\uB3D9 \uAE30\uACC4(linear bounded automaton, LBA)\uB294 \uACC4\uC0B0 \uB2A5\uB825\uC744 \uC81C\uD55C\uD55C \uD29C\uB9C1 \uAE30\uACC4\uC758 \uC77C\uC885\uC774\uB2E4."@ko . . "En informatique th\u00E9orique, et en particulier en th\u00E9orie des automates, un automate lin\u00E9airement born\u00E9 (en anglais linear bounded automaton, abr\u00E9g\u00E9 en LBA) est une machine de Turing non d\u00E9terministe qui n'utilise qu'une portion contigu\u00EB du ruban de taille lin\u00E9aire en la taille de l'entr\u00E9e."@fr . . . . . "Um Aut\u00F4mato linearmente limitado \u00E9 uma M\u00E1quina de Turing com mem\u00F3ria limitada e \u00E9 o mecanismo reconhecedor de Linguagens sens\u00EDveis ao contexto. Sua fita \u00E9 limitada e portanto finita. Ele s\u00F3 consegue resolver problemas que usem uma quantidade de mem\u00F3ria que possa caber dentro da fita usada para entrada. Se por acaso utilizarmos um alfabeto de fita maior que o alfabeto de entrada ent\u00E3o teremos um incremento da mem\u00F3ria dispon\u00EDvel por at\u00E9 um fator constante, por isso se tivermos uma entrada de tamanho n a quantidade de mem\u00F3ria dispon\u00EDvel ser\u00E1 linear em rela\u00E7\u00E3o a n. Apesar de suas restri\u00E7\u00F5es os ALLs s\u00E3o bastantes potentes, podemos citar que os decisores para o problema da aceita\u00E7\u00E3o de um AFD para uma dada entrada, para o problema da vacuidade de um dado AFD, para o problema da aceita\u00E7\u00E3o de uma gram\u00E1tica livre de contexto e para a vacuidade de uma dada gram\u00E1tica livre de contexto s\u00E3o todos ALLs. O Aut\u00F4mato Linearmente Limitado \u00E9 um formalismo reconhecedor n\u00E3o determin\u00EDstico, o qual pode ser definido por uma \u00F3ctupla (\u03A3, S, \u03B4, S0, F, V, <, >), [1][2] e [3] onde: \n* \u03A3 \u00E9 o alfabeto de s\u00EDmbolos de entrada; \n* S \u00E9 o conjunto de estados poss\u00EDveis, o qual \u00E9 finito; \n* \u03B4 \u00E9 o programa ou fun\u00E7\u00E3o de transi\u00E7\u00E3o \n* \u03B4: S \u00D7 (\u03A3 \u222A V \u222A {<, >}) \u2192 2S \u00D7 (\u03A3 \u222A V \u222A {<, >}) \u00D7 {E, D} a qual \u00E9 uma fun\u00E7\u00E3o parcial; \n* S0 \u00E9 o estado inicial da m\u00E1quina, S0 \u2208 S; \n* F \u00E9 o conjunto de estados finais, F \u2282 S; \n* V \u00E9 o alfabeto auxiliar (pode ser vazio); \n* < \u00E9 o s\u00EDmbolo especial marcador de in\u00EDcio da fita; \n* > \u00E9 o s\u00EDmbolo especial marcador de fim da fita. O ALL possui uma fita de entrada a qual tem tamanho finito e \u00E9 delimitada pelos s\u00EDmbolos , possui tamb\u00E9m um cabe\u00E7ote de Leitura/Escrita, o qual tem a posi\u00E7\u00E3o inicial sempre na primeira c\u00E9lula a direita do s\u00EDmbolo \u00E1, sempre que o cabe\u00E7ote l\u00EA um s\u00EDmbolo ele deve escrever outro na mesma c\u00E9lula e mover-se para esquerda ou para direita. Como tem car\u00E1ter n\u00E3o determin\u00EDstico os estados podem ter mais de uma sa\u00EDda com o mesmo s\u00EDmbolo, quando isso ocorre uma \u2018c\u00F3pia\u2019 do ALL \u00E9 criada e executada simultaneamente, a primeira \u2018c\u00F3pia\u2019 que parar em um estado final \u00E9 aceita, e as outras s\u00E3o exclu\u00EDdas. A transi\u00E7\u00E3o \u00E9 representada por (s\u00EDmbolo lido, s\u00EDmbolo a ser escrito, dire\u00E7\u00E3o para qual o cabe\u00E7ote de leitura/escrita deve ir). Uma caracter\u00EDstica importante dos ALLs \u00E9 que um ALL pode ter somente um n\u00FAmero limitado de configura\u00E7\u00F5es dado que a entrada tem tamanho n. Dado que a entrada tem tamanho n, seja M um ALL com \"q\" estados e \"s\" s\u00EDmbolos no alfabeto da fita ent\u00E3o podemos dizer que existem exatamente \"q*n*s^n\" configura\u00E7\u00F5es distintas de M."@pt . . . . . . "Line\u00E1rn\u011B ohrani\u010Den\u00FD Turing\u016Fv stroj"@cs . . "Linear beschr\u00E4nkte Turingmaschine"@de . . . "7253"^^ . "Pojem line\u00E1rn\u011B ohrani\u010Den\u00FD Turing\u016Fv stroj ozna\u010Duje v informatice Turing\u016Fv stroj, kter\u00FD m\u00E1 omezen\u00ED p\u0159i z\u00E1pisu na p\u00E1sku. Na rozd\u00EDl od b\u011B\u017En\u00E9ho Turingova stroje toti\u017E nesm\u00ED zapisovat na neomezen\u011B mnoho bun\u011Bk p\u00E1sky, ale pouze na prvn\u00EDch n bun\u011Bk, kde n je omezeno line\u00E1rn\u00ED funkc\u00ED vzhledem k d\u00E9lce vstupn\u00EDho slova. V ur\u010Dit\u00E9m smyslu je tak tento stroj bli\u017E\u0161\u00ED b\u011B\u017En\u00FDm po\u010D\u00EDta\u010D\u016Fm."@cs . . . . . "In computer science, a linear bounded automaton (plural linear bounded automata, abbreviated LBA) is a restricted form of Turing machine."@en . . . . . . . . . "Un automa lineare limitato (in inglese linear bounded automata, LBA) \u00E8 una particolare macchina di Turing non deterministica in cui la lunghezza del nastro \u00E8 funzione lineare della dimensione dell'input. Questi automi sono in grado di accettare i linguaggi dipendenti dal contesto generati da grammatiche sensibili al contesto (o di Tipo-1 secondo la gerarchia di Chomsky)."@it . . . "Pojem line\u00E1rn\u011B ohrani\u010Den\u00FD Turing\u016Fv stroj ozna\u010Duje v informatice Turing\u016Fv stroj, kter\u00FD m\u00E1 omezen\u00ED p\u0159i z\u00E1pisu na p\u00E1sku. Na rozd\u00EDl od b\u011B\u017En\u00E9ho Turingova stroje toti\u017E nesm\u00ED zapisovat na neomezen\u011B mnoho bun\u011Bk p\u00E1sky, ale pouze na prvn\u00EDch n bun\u011Bk, kde n je omezeno line\u00E1rn\u00ED funkc\u00ED vzhledem k d\u00E9lce vstupn\u00EDho slova. V ur\u010Dit\u00E9m smyslu je tak tento stroj bli\u017E\u0161\u00ED b\u011B\u017En\u00FDm po\u010D\u00EDta\u010D\u016Fm. Line\u00E1rn\u011B ohrani\u010Den\u00E9 Turingovy stroje um\u00ED akceptovat jazyky ze t\u0159\u00EDdy kontextov\u00FDch jazyk\u016F. Lze dok\u00E1zat, \u017Ee pro ka\u017Ed\u00FD line\u00E1rn\u011B ohrani\u010Den\u00FD Turing\u016Fv stroj lze sestrojit Turing\u016Fv stroj, kter\u00FD nepot\u0159ebuje p\u00E1sku del\u0161\u00ED ne\u017E je d\u00E9lka vstupn\u00EDho slova."@cs . . "\u7DDA\u5F62\u62D8\u675F\u30AA\u30FC\u30C8\u30DE\u30C8\u30F3\uFF08\u305B\u3093\u3051\u3044\u3053\u3046\u305D\u304F\u30AA\u30FC\u30C8\u30DE\u30C8\u30F3\u3001Linear Bounded Automaton\uFF09\u306F\u3001\u5236\u9650\u3055\u308C\u305F\u30C1\u30E5\u30FC\u30EA\u30F3\u30B0\u30DE\u30B7\u30F3\u3067\u3042\u308B\u3002LBA \u3068\u7565\u8A18\u3055\u308C\u308B\u3002\u6709\u9650\u7A2E\u985E\u306E\u6587\u5B57\u3092\u4FDD\u6301\u3067\u304D\u308B\u30C6\u30FC\u30D7\u3068\u305D\u306E\u30C6\u30FC\u30D7\u306E\u8AAD\u307F\u66F8\u304D\u304C\u3067\u304D\u308B\u30D8\u30C3\u30C9\u3092\u6301\u3061\u3001\u6709\u9650\u6570\u306E\u72B6\u614B\u3092\u6301\u3064\u3002\u30C1\u30E5\u30FC\u30EA\u30F3\u30B0\u30DE\u30B7\u30F3\u3068\u7570\u306A\u308B\u306E\u306F LBA \u306E\u30C6\u30FC\u30D7\u9577\u304C\u6709\u9650\u3067\u3042\u308B\u3053\u3068\u3067\u3001\u305D\u306E\u9577\u3055\u306F\u30C6\u30FC\u30D7\u4E0A\u306E\u521D\u671F\u5165\u529B\u6587\u5B57\u5217\u306E\u9577\u3055\u306B\u6BD4\u4F8B\u3059\u308B\uFF08\u3064\u307E\u308A\u4E00\u6B21\u95A2\u6570\u3067\u3042\u308B\uFF09\u3002\u3053\u306E\u5236\u9650\u306B\u3088\u308A LBA \u306F\u3042\u308B\u610F\u5473\u3067\u306F\u30C1\u30E5\u30FC\u30EA\u30F3\u30B0\u30DE\u30B7\u30F3\u3088\u308A\u3082\u5B9F\u5728\u306E\u30B3\u30F3\u30D4\u30E5\u30FC\u30BF\u306E\u6B63\u78BA\u306A\u30E2\u30C7\u30EB\u3068\u8A00\u3048\u308B\u3002 \u7DDA\u5F62\u62D8\u675F\u30AA\u30FC\u30C8\u30DE\u30C8\u30F3\u306F\u6587\u8108\u4F9D\u5B58\u8A00\u8A9E\u3092\u53D7\u5BB9\u3059\u308B\u3002\u305D\u306E\u30AF\u30E9\u30B9\u306E\u8A00\u8A9E\u306E\u6587\u6CD5\u3067\u5236\u9650\u3055\u308C\u3066\u3044\u308B\u3053\u3068\u306F\u3001\u3042\u308B\u6587\u5B57\u5217\u304B\u3089\u77ED\u3044\u5225\u306E\u6587\u5B57\u5217\u3078\u306E\u30DE\u30C3\u30D4\u30F3\u30B0\u3092\u6301\u305F\u306A\u3044\u3053\u3068\u3067\u3042\u308B\u3002\u3057\u305F\u304C\u3063\u3066\u3001\u6587\u8108\u4F9D\u5B58\u6587\u6CD5\u306B\u3088\u3063\u3066\u751F\u6210\u3055\u308C\u308B\u6587\u5B57\u5217\u306F\u3001\u305D\u308C\u81EA\u8EAB\u3088\u308A\u9577\u3044\u6587\u578B\u3092\u5185\u5305\u3059\u308B\u3053\u3068\u304C\u3067\u304D\u306A\u3044\u3002\u7DDA\u5F62\u62D8\u675F\u30AA\u30FC\u30C8\u30DE\u30C8\u30F3\u3068\u6587\u8108\u4F9D\u5B58\u8A00\u8A9E\u306F\u4E00\u5BFE\u4E00\u306E\u5BFE\u5FDC\u95A2\u4FC2\u306B\u3042\u308B\u306E\u3067\u3001\u672C\u6765\u306E\u6587\u5B57\u5217\u304C\u66F8\u304B\u308C\u305F\u30C6\u30FC\u30D7\u306E\u9577\u3055\u304C\u3042\u308C\u3070\u3001\u305D\u306E\u30AA\u30FC\u30C8\u30DE\u30C8\u30F3\u306B\u7406\u89E3\u3067\u304D\u308B\u6587\u5B57\u5217\u306B\u306F\u5FC5\u8981\u5341\u5206\u3067\u3042\u308B\u3002"@ja . "\u7DDA\u5F62\u62D8\u675F\u30AA\u30FC\u30C8\u30DE\u30C8\u30F3"@ja . . "Un automa lineare limitato (in inglese linear bounded automata, LBA) \u00E8 una particolare macchina di Turing non deterministica in cui la lunghezza del nastro \u00E8 funzione lineare della dimensione dell'input. Questi automi sono in grado di accettare i linguaggi dipendenti dal contesto generati da grammatiche sensibili al contesto (o di Tipo-1 secondo la gerarchia di Chomsky). Come una macchina di Turing, il nastro di un LBA \u00E8 composto da celle che possono contenere simboli appartenenti ad un alfabeto finito. L'automa possiede un numero finito di stati e la sua testina pu\u00F2 leggere e scrivere una sola cella per volta."@it . . . . . "Linear bounded automaton"@en . . . . "Automat liniowo ograniczony (ang. linear bounded automaton) \u2013 ograniczona wersja maszyny Turinga, kt\u00F3ra podczas obliczenia na s\u0142owie wej\u015Bciowym d\u0142ugo\u015Bci n mo\u017Ce wykorzysta\u0107 jedynie O(n) kom\u00F3rek ta\u015Bmy. Innymi s\u0142owy, dost\u0119pna pami\u0119\u0107 jest funkcj\u0105 liniow\u0105 od d\u0142ugo\u015Bci wej\u015Bcia. Mo\u017Cna tak\u017Ce powiedzie\u0107, \u017Ce mo\u017Ce ona w trakcie dzia\u0142ania wykorzystywa\u0107 tylko te kom\u00F3rki na ta\u015Bmie, w kt\u00F3rych zapisane jest s\u0142owo wej\u015Bciowe."@pl . . . "Automat liniowo ograniczony (ang. linear bounded automaton) \u2013 ograniczona wersja maszyny Turinga, kt\u00F3ra podczas obliczenia na s\u0142owie wej\u015Bciowym d\u0142ugo\u015Bci n mo\u017Ce wykorzysta\u0107 jedynie O(n) kom\u00F3rek ta\u015Bmy. Innymi s\u0142owy, dost\u0119pna pami\u0119\u0107 jest funkcj\u0105 liniow\u0105 od d\u0142ugo\u015Bci wej\u015Bcia. Mo\u017Cna tak\u017Ce powiedzie\u0107, \u017Ce mo\u017Ce ona w trakcie dzia\u0142ania wykorzystywa\u0107 tylko te kom\u00F3rki na ta\u015Bmie, w kt\u00F3rych zapisane jest s\u0142owo wej\u015Bciowe."@pl . . "\u7EBF\u6027\u6709\u754C\u81EA\u52A8\u673A\uFF08\u82F1\u6587\uFF1ALinear bounded automaton\uFF0C\u7B80\u5199\uFF1A LBA\uFF09\u662F\u53D7\u9650\u5F62\u5F0F\u7684\u975E\u786E\u5B9A\u56FE\u7075\u673A\u3002\u5B83\u62E5\u6709\u7531\u5305\u542B\u6765\u81EA\u6709\u9650\u5B57\u6BCD\u8868\u7684\u7B26\u53F7\u7684\u5355\u5143\u6784\u6210\u7684\u78C1\u5E26\uFF0C\u53EF\u4EE5\u4E00\u6B21\u8BFB\u53D6\u548C\u5199\u5165\u78C1\u5E26\u4E0A\u4E00\u4E2A\u5355\u5143\u7684\u5E76\u53EF\u4EE5\u79FB\u52A8\u7684\u78C1\u5934\uFF0C\u548C\u6709\u9650\u6570\u76EE\u4E2A\u72B6\u6001\u3002\u5B83\u533A\u522B\u4E8E\u66F4\u4E3A\u666E\u904D\u7684\u56FE\u7075\u673A\u5728\u4E8E\u5C3D\u7BA1\u78C1\u5E26\u6700\u521D\u88AB\u8BA4\u4E3A\u662F\u65E0\u9650\u7684\uFF0C\u53EA\u6709\u5176\u957F\u5EA6\u662F\u521D\u59CB\u8F93\u5165\u7684\u7EBF\u6027\u51FD\u6570\u7684\u6709\u9650\u4E34\u8FD1\u90E8\u5206\u53EF\u4EE5\u88AB\u8BFB\u5199\u78C1\u5934\u8BBF\u95EE\u3002\u8FD9\u4E2A\u9650\u5236\u4F7F LBA \u6210\u4E3A\u5728\u67D0\u4E9B\u65B9\u9762\u6BD4\u56FE\u7075\u673A\u66F4\u63A5\u8FD1\u5B9E\u9645\u5B58\u5728\u7684\u8BA1\u7B97\u673A\u7684\u7CBE\u786E\u6A21\u578B\u3002"@zh . . "Aut\u00F2mat linealment acotat"@ca . . "En informatique th\u00E9orique, et en particulier en th\u00E9orie des automates, un automate lin\u00E9airement born\u00E9 (en anglais linear bounded automaton, abr\u00E9g\u00E9 en LBA) est une machine de Turing non d\u00E9terministe qui n'utilise qu'une portion contigu\u00EB du ruban de taille lin\u00E9aire en la taille de l'entr\u00E9e."@fr .