Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged non-determinism
0
votes
0
answers
1
Michael Sipser Edition 3 Exercise 3 Question 3 (Page No. 187)
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 ... many children and every branch of the tree has finitely many nodes, the tree itself has finitely many nodes.)
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 t...
admin
483
views
admin
asked
Oct 12, 2019
Theory of Computation
michael-sipser
theory-of-computation
non-determinism
turing-machine
descriptive
+
–
0
votes
0
answers
2
Ullman 2nd edition Theorem 2.22 (Section 2.5)
Here why they are saying we must convert DFA transition into NFA transition?
Here why they are saying we must convert DFA transition into NFA transition?
Bhaskar Singh
588
views
Bhaskar Singh
asked
Mar 3, 2019
Theory of Computation
theory-of-computation
finite-automata
non-determinism
+
–
1
votes
1
answer
3
Self Doubt - Confusion on language represented by DFA and NFA
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?
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) =...
Bhaskar Singh
687
views
Bhaskar Singh
asked
Feb 20, 2019
Theory of Computation
theory-of-computation
finite-automata
non-determinism
+
–
0
votes
0
answers
4
Construct DFA for given Language
For the language which ends with 01 or 11 or 10 or 11 for $\sum$={0,1}* .Is dfa possible for this language?
For the language which ends with 01 or 11 or 10 or 11 for $\sum$={0,1}* .Is dfa possible for this language?
sripo
415
views
sripo
asked
Oct 16, 2018
Theory of Computation
minimal-state-automata
theory-of-computation
finite-automata
non-determinism
+
–
1
votes
1
answer
5
Language accepted by given NFA
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
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...
GateAspirant999
1.1k
views
GateAspirant999
asked
Mar 2, 2018
Theory of Computation
finite-automata
non-determinism
theory-of-computation
+
–
1
votes
0
answers
6
MadeEasy Test Series 2018: Theory of Computation - Non Determinism
isn't the ans is 3 i.e p,q,r
isn't the ans is 3 i.e p,q,r
Sukhdip Singh
349
views
Sukhdip Singh
asked
Jan 17, 2018
Theory of Computation
theory-of-computation
non-determinism
made-easy-test-series
madeeasy-testseries-2018
+
–
1
votes
0
answers
7
#pda #tm #deterministic
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 ?
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. A...
Shivansh Gupta
347
views
Shivansh Gupta
asked
Jul 6, 2017
Theory of Computation
turing-machine
pushdown-automata
non-determinism
+
–
26
votes
1
answer
8
GATE IT 2004 | Question: 9
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 ... automata always accept the same set of languages A finite set of string from some alphabet is always a regular language
Which one of the following statements is FALSE?There exist context-free languages such that all the context-free grammars generating them are ambiguousAn unambiguous cont...
Ishrat Jahan
6.5k
views
Ishrat Jahan
asked
Nov 1, 2014
Theory of Computation
gateit-2004
theory-of-computation
easy
non-determinism
+
–
19
votes
3
answers
9
GATE CSE 1994 | Question: 1.16
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
Which of the following conversions is not possible (algorithmically)?Regular grammar to context free grammarNon-deterministic FSA to deterministic FSANon-deterministic PD...
Kathleen
7.6k
views
Kathleen
asked
Oct 4, 2014
Theory of Computation
gate1994
theory-of-computation
easy
non-determinism
+
–
29
votes
3
answers
10
GATE CSE 2011 | Question: 8
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 ... Turing machine and Non-deterministic single tape Turing machine Single tape Turing machine and multi-tape Turing machine
Which of the following pairs have DIFFERENT expressive power?Deterministic finite automata (DFA) and Non-deterministic finite automata (NFA)Deterministic push down automa...
go_editor
9.5k
views
go_editor
asked
Sep 29, 2014
Theory of Computation
gatecse-2011
theory-of-computation
easy
non-determinism
+
–
20
votes
1
answer
11
GATE CSE 1998 | Question: 1.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 Turing machines. Multi-tape Turing machines are available are equivalent to Single-tape Turing machines.
Regarding the power of recognition of languages, which of the following statements is false?The non-deterministic finite-state automata are equivalent to deterministic fi...
Kathleen
8.2k
views
Kathleen
asked
Sep 25, 2014
Theory of Computation
gate1998
theory-of-computation
easy
non-determinism
+
–
27
votes
2
answers
12
GATE CSE 2005 | Question: 54
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 ... $D_f = N_f \text{ and } D_p = N_p$ $D_f =N_f \text{ and } D_p \subset N_p$
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...
Kathleen
4.3k
views
Kathleen
asked
Sep 22, 2014
Theory of Computation
gatecse-2005
theory-of-computation
easy
non-determinism
+
–
28
votes
1
answer
13
GATE CSE 1992 | Question: 02,xx
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 the same language". $M_{1}$ ... $M_{1}$ and $M_2$, the above statement true.
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}$ r...
Kathleen
7.4k
views
Kathleen
asked
Sep 13, 2014
Theory of Computation
gate1992
theory-of-computation
easy
non-determinism
multiple-selects
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
