en
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
Full articles
Categories
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
You write
User
Login
Registration
Password recovery
Tags
Language tags
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
Tag nondeterminism - This is page 1 - GeneraCodice
Show $L = $ { w $\in (a,b) ^* $| for every u substring of w, $-5\le|u|_a−|u|_b\le5\}$ is regular
https://www.generacodice.com/en/articolo/2476181/show-l-w-in-a-b-for-every-u-substring-of-w-5-le-u-a-u-b-le5-is-regular
finite-automata
-
automata
-
regular-languages
-
nondeterminism
cs.stackexchange
Can an $NDTM$ simultaneously perform a set of operations on all strings of a given length?
https://www.generacodice.com/en/articolo/2469863/can-an-ndtm-simultaneously-perform-a-set-of-operations-on-all-strings-of-a-given-length
turing-machines
-
nondeterminism
cs.stackexchange
Is s-grammar powerful enough to generate all possible DCFL?
https://www.generacodice.com/en/articolo/2469242/is-s-grammar-powerful-enough-to-generate-all-possible-dcfl
formal-grammars
-
nondeterminism
-
context-free
cs.stackexchange
Can a non-deterministic machine merge its branches?
https://www.generacodice.com/en/articolo/2468903/can-a-non-deterministic-machine-merge-its-branches
nondeterminism
cs.stackexchange
Is $NSPACE(S(n)) \subseteq DSPACE(S(n))$ if $S(n)$ is time-constructible?
https://www.generacodice.com/en/articolo/2468393/is-nspace-s-n-subseteq-dspace-s-n-if-s-n-is-time-constructible
complexity-theory
-
time-complexity
-
space-complexity
-
nondeterminism
cs.stackexchange
When our two-state PDA constructed from CFG is non-deterministic PDA?
https://www.generacodice.com/en/articolo/2467830/when-our-two-state-pda-constructed-from-cfg-is-non-deterministic-pda
automata
-
formal-languages
-
pushdown-automata
-
nondeterminism
-
context-free
cs.stackexchange
State complexity of converting epsilon-NFAs to NFAs without epsilon transitions
https://www.generacodice.com/en/articolo/2467123/state-complexity-of-converting-epsilon-nfas-to-nfas-without-epsilon-transitions
complexity-theory
-
finite-automata
-
nondeterminism
cs.stackexchange
If anything can be verified efficiently, must it be solvable efficiently on a Non-Deterministic machine?
https://www.generacodice.com/en/articolo/2466081/if-anything-can-be-verified-efficiently-must-it-be-solvable-efficiently-on-a-non-deterministic-machine
complexity-theory
-
nondeterminism
cs.stackexchange
Arden's Rule, DFA & NFA to regular expressions
https://www.generacodice.com/en/articolo/2455769/arden-s-rule-dfa-nfa-to-regular-expressions
finite-automata
-
algorithms
-
nondeterminism
-
regular-expressions
cs.stackexchange
Non-deterministic Turing machine for $L_1 = \{w\#0^n|w \text{ is a suffix of some $x$ in $L$ with } |x|=n\}$
https://www.generacodice.com/en/articolo/2445836/non-deterministic-turing-machine-for-l-1-w-0-n-w-text-is-a-suffix-of-some-x-in-l-with-x-n
turing-machines
-
time-complexity
-
formal-languages
-
nondeterminism
cs.stackexchange
«
1
2
3
4
5
6
»
Results found: 288