Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Bencher Last
6
answers
1
GATE CSE 2005 | Question: 53
Consider the machine $M$: The language recognized by $M$ is: $\left\{ w \in \{a, b\}^* \text{ | every a in $w$ is followed by exactly two $b$'s} \right\}$ ... $'} \right\}$ $\left\{w \in \{a, b\}^* \text{ | $w$ does not contain $aa$' as a substring} \right\}$
Consider the machine $M$:The language recognized by $M$ is:$\left\{ w \in \{a, b\}^* \text{ | every a in $w$ is followed by exactly two $b$’s} \right\}$$\left\{w \in \{...
13.2k
views
answered
Jul 21, 2017
Theory of Computation
gatecse-2005
theory-of-computation
finite-automata
normal
+
–
0
answers
2
Deterministic Push down automata
What will be the DPDA of a language L = {aibj|for every prefix of the string |n(a)-n(b)|≤2 where n(a)=number of a & n(b)=number of b}
What will be the DPDA of a language L = {aibj|for every prefix of the string |n(a)-n(b)|≤2 where n(a)=number of a & n(b)=number of b}
238
views
asked
Jul 21, 2017
Theory of Computation
theory-of-computation
+
–
0
answers
3
Context free languages
The number of languages from the below given options that are Deterministic Context Free languages are? (a) apbqcrds | p+q=r+s (b) apbqcrds | p+r=q+s (c) wxwR | w∈(0,1) x∈(a,b) (d) aibjck | j=i-k Only (a), (b) and (d) are DCFLs Only (a) and (b) are DCFLs Only (a), (c), (d) are DCFLs All are DCFLs Answer is (4).. Why????
The number of languages from the below given options that are Deterministic Context Free languages are?(a) apbqcrds | p+q=r+s(b) apbqcrds | p+r=q+s(c) wxwR | w∈(0,1) x�...
176
views
asked
Jul 21, 2017
Theory of Computation
theory-of-computation
+
–
0
answers
4
Asked by my friend
Consider the following DFA Minimum number of states required to construct an equivalent NFA is ? (A) 4 (B) 5 (C) 3 (D) 6 In the above question the solution provided is that it is a DFA that accepts all the strings containing at most two 1’s.. When we have not been provided any information about any state being final or initial state, how are we supposed to proceed ??
Consider the following DFAMinimum number of states required to construct an equivalent NFA is ?(A) 4(B) 5(C) 3(D) 6In the above question the solution provided is that it ...
201
views
asked
Jul 20, 2017
Theory of Computation
theory-of-computation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register