Português
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
Artigos completos
Categorias
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
Você escreve
Do utilizador
Conecte-se
Cadastro
Recuperação de senha
Tag
Tags de idioma
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
Tag linear-bounded-automata - Esta é a página 1 - GeneraCodice
Does a type-1 automaton always have to terminate?
https://www.generacodice.com/pt/articolo/1620800/does-a-type-1-automaton-always-have-to-terminate
termination
-
formal-languages
-
linear-bounded-automata
cs.stackexchange
Decidability of the language of all deterministic LBA where all states are reachable
https://www.generacodice.com/pt/articolo/1620653/decidability-of-the-language-of-all-deterministic-lba-where-all-states-are-reachable
formal-languages
-
semi-decidability
-
linear-bounded-automata
cs.stackexchange
Number of Configurations of LBA(Linear Bounded Automaton)
https://www.generacodice.com/pt/articolo/1616377/number-of-configurations-of-lba-linear-bounded-automaton
turing-machines
-
automata
-
linear-bounded-automata
cs.stackexchange
A push-down automaton with two stacks which is equivalent to a linear-bounded automaton
https://www.generacodice.com/pt/articolo/1615824/a-push-down-automaton-with-two-stacks-which-is-equivalent-to-a-linear-bounded-automaton
turing-machines
-
pushdown-automata
-
context-free
-
context-sensitive
-
linear-bounded-automata
cs.stackexchange
Undecidability of emptiness of LBA
https://www.generacodice.com/pt/articolo/1611447/undecidability-of-emptiness-of-lba
turing-machines
-
linear-bounded-automata
cs.stackexchange
Is it possible to convert LBA into DFA?
https://www.generacodice.com/pt/articolo/1607316/is-it-possible-to-convert-lba-into-dfa
finite-automata
-
linear-bounded-automata
cs.stackexchange
Show that $A_\mathrm{LBA}$ is PSPACE-Complete?
https://www.generacodice.com/pt/articolo/1606280/show-that-a-mathrm-lba-is-pspace-complete
complexity-theory
-
turing-machines
-
space-complexity
-
reductions
-
linear-bounded-automata
cs.stackexchange
Prove that it is undecidable whether a given LBA accepts a regular set
https://www.generacodice.com/pt/articolo/1602198/prove-that-it-is-undecidable-whether-a-given-lba-accepts-a-regular-set
complexity-theory
-
turing-machines
-
undecidability
-
linear-bounded-automata
cs.stackexchange
A confusion about the Reduction via Computation History
https://www.generacodice.com/pt/articolo/1588280/a-confusion-about-the-reduction-via-computation-history
computability
-
undecidability
-
proof-techniques
-
reductions
-
linear-bounded-automata
cs.stackexchange
Why are Linearly Bounded Turing Machines more powerful than Finite State Automata?
https://www.generacodice.com/pt/articolo/1581798/why-are-linearly-bounded-turing-machines-more-powerful-than-finite-state-automata
finite-automata
-
computation-models
-
linear-bounded-automata
cs.stackexchange
«
1
2
3
4
»
Resultados encontrados: 35