# Recent questions tagged non-determinism

1
Modify the proof of Theorem $3.16$ to obtain Corollary $3.19$, showing that a language is decidable iff some nondeterministic Turing machine decides it. (You may assume the following theorem about trees. If every node in a tree has finitely many children and every branch of the tree has finitely many nodes, the tree itself has finitely many nodes.)
2
Here why they are saying we must convert DFA transition into NFA transition?
1 vote
3
If a DFA "D" have symbol {0,1,2} and NFA "N" have symbol {0,1} but both are representing strings ending with 01 and whole string only contain {0,1} then can we say L(N) = L(D) i.e language represented by DFA is equal to language represented by NFA?
4
For the language which ends with 01 or 11 or 10 or 11 for $\sum$={0,1}* .Is dfa possible for this language?
1 vote
5
Language accepted by following NFA and number of states in DFA accepting that Language are: $\{a^n|n=2k,kϵN\}$ and 2 $\{a^{2n}|n=2k,kϵN\}$ and 2 $\{a^n|n=2k,kϵ N\}$ and 3 $\{a^{2n}|n=2k,kϵ N\}$ and 3
1 vote
6
isn't the ans is 3 i.e p,q,r
1 vote
7
How can a DTM can simulate a NTM, but a DPDA can not simulate a NPDA. ? Reason? I read the proedure for a DTM to simulate a NTM but can not get why its not so with pda. Any clue ?
8
Which one of the following statements is FALSE? There exist context-free languages such that all the context-free grammars generating them are ambiguous An unambiguous context-free grammar always has a unique parse tree for each string of the language generated by ... pushdown automata always accept the same set of languages A finite set of string from some alphabet is always a regular language
9
Which of the following conversions is not possible (algorithmically)? Regular grammar to context free grammar Non-deterministic FSA to deterministic FSA Non-deterministic PDA to deterministic PDA Non-deterministic Turing machine to deterministic Turing machine
10
Which of the following pairs have DIFFERENT expressive power? Deterministic finite automata (DFA) and Non-deterministic finite automata (NFA) Deterministic push down automata (DPDA) and Non-deterministic push down automata (NPDA) Deterministic single tape Turing machine and Non-deterministic single tape Turing machine Single tape Turing machine and multi-tape Turing machine
11
Regarding the power of recognition of languages, which of the following statements is false? The non-deterministic finite-state automata are equivalent to deterministic finite-state automata. Non-deterministic Push-down automata are equivalent to deterministic ... equivalent to deterministic Turing machines. Multi-tape Turing machines are available are equivalent to Single-tape Turing machines.
Let $N_f$ and $N_p$ denote the classes of languages accepted by non-deterministic finite automata and non-deterministic push-down automata, respectively. Let $D_f$ and $D_p$ denote the classes of languages accepted by deterministic finite automata and deterministic push-down automata respectively. Which one ... $D_f = N_f \text{ and } D_p = N_p$ $D_f =N_f \text{ and } D_p \subset N_p$
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: In which of the cases stated below is the following statement true? "For every non-deterministic machine $M_{1}$ there exists an equivalent deterministic machine $M_{2}$ recognizing ... $M_{1}$ is a non-deterministic Turing machine. For no machines $M_{1}$ and $M_2$, the above statement true.