日本の
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
完全な記事
カテゴリ
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
あなたが書く
ユーザー
ログイン
登録
パスワードの復元
タグ
言語タグ
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
タグlinear-bounded-automata - これはページ2です - GeneraCodice
Is it possible to convert LBA into DFA?
https://www.generacodice.com/jp/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/jp/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/jp/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/jp/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/jp/articolo/1581798/why-are-linearly-bounded-turing-machines-more-powerful-than-finite-state-automata
finite-automata
-
computation-models
-
linear-bounded-automata
cs.stackexchange
Why cannot we reduce the Emptiness problem of LBA to the Acceptance problem of LBA?
https://www.generacodice.com/jp/articolo/1580796/why-cannot-we-reduce-the-emptiness-problem-of-lba-to-the-acceptance-problem-of-lba
formal-languages
-
undecidability
-
linear-bounded-automata
cs.stackexchange
Is every language in PTime also context-sensitive?
https://www.generacodice.com/jp/articolo/1579911/is-every-language-in-ptime-also-context-sensitive
complexity-theory
-
polynomial-time
-
context-sensitive
-
linear-bounded-automata
cs.stackexchange
Restrictions to counter machines capturing LBA
https://www.generacodice.com/jp/articolo/1578238/restrictions-to-counter-machines-capturing-lba
turing-machines
-
computability
-
linear-bounded-automata
cs.stackexchange
How does augmenting linear bounded automata tape alphabets increase memory?
https://www.generacodice.com/jp/articolo/1545743/how-does-augmenting-linear-bounded-automata-tape-alphabets-increase-memory
turing-machines
-
linear-bounded-automata
cs.stackexchange
Is a LBA with stack more powerful than a LBA without?
https://www.generacodice.com/jp/articolo/1544410/is-a-lba-with-stack-more-powerful-than-a-lba-without
automata
-
computation-models
-
turing-completeness
-
stacks
-
linear-bounded-automata
cs.stackexchange
«
1
2
3
4
»
結果が見つかりました: 35