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 dipanjan
0
answers
1
Peter Linz Edition 4 Exercise 8.1 Question 8 (Page No. 212)
Determine whether or not the following languages are context-free. (a) $L=$ {$a^nww^Ra^n : n ≥ 0, w ∈$ {$a,b$}*} (b) $L=$ {$a^nb^ja^nb^j : n ≥ 0, j ≥ 0$}. (C) $L=$ {$a^nb^ja^jb^n : n ≥ 0, j ≥ 0$}. (d) $L=$ {$a^nb^ja^kb^l : n + j ≤ k + l$ ... $ L=$ {$a^nb^nc^j : n ≤j$}. (g) $L=$ {$w ∈$ {$a, b, c$}* $: n_a(w)= n_b (w)=2n_c(w)$}.
Determine whether or not the following languages are context-free.(a) $L=$ {$a^nww^Ra^n : n ≥ 0, w ∈$ {$a,b$}*}(b) $L=$ {$a^nb^ja^nb^j : n ≥ 0, j ≥ 0$}.(C) $L=$ {...
722
views
commented
Jun 10, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
context-free-language
pumping-lemma
proof
+
–
4
answers
2
UGC NET CSE | January 2017 | Part 3 | Question: 62
Which of the following pairs have different expressive power? Single-tape-turing machine and multi-dimensional turing machine Multi-tape-turing machine and multi-dimensional turing machine Deterministic push down automata and non-deterministic push down automata Deterministic finite automata and non-deterministic finite automata
Which of the following pairs have different expressive power?Single-tape-turing machine and multi-dimensional turing machineMulti-tape-turing machine and multi-dimensiona...
991
views
answered
Jun 8, 2020
Theory of Computation
ugcnetcse-jan2017-paper3
theory-of-computation
turing-machine
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register