Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for context-free-grammars
0
votes
1
answer
1
Test Series
If $L_1$ is DCFL and $L_2$ is context free language. Consider the below given statements Which is correct between these and why ? (S1 is correct.. but why ??) . I couldn’t understand the explanation given in the solution..
If $L_1$ is DCFL and $L_2$ is context free language. Consider the below given statementsWhich is correct between these and why ? (S1 is correct.. but why ??) . I couldn�...
Hardik Maheshwari
1.3k
views
Hardik Maheshwari
asked
Jan 14, 2019
Theory of Computation
context-free-language
context-sensitive
context
deterministic-context-free-grammars
theory-of-computation
+
–
2
votes
5
answers
2
Peter Linz Exercise 7.3
#3 : Is the language L= { anbn : n>=1 } U {b} deterministic ? #4 : Is the language L={anbn : n>=1} U {a} deterministic ? #7 Is the following regular language deterministic? L= { anbmck : n=m or m=k } #8 Is the L = {anbm : n ... ended and WR has started. #11- No Idea about it. Please someone verify and tell me is my way of analysis and the analysis is correct or not?
#3 : Is the language L= { anbn : n>=1 } U {b} deterministic ?#4 : Is the language L={anbn : n>=1} U {a} deterministic ?#7 Is the following regular language deterministic?...
Ayush Upadhyaya
3.4k
views
Ayush Upadhyaya
asked
Mar 31, 2017
Theory of Computation
theory-of-computation
deterministic-context-free-grammars
context-free-language
+
–
2
votes
2
answers
3
[TOC] Basic doubt in DPDA
Following is the PDA that accept equal number of a and b. How can this be converted to DPDA? When stack top is Z,that it can read epsillon or a or b,which can create choice.So how can i remove choice in this and make it deterministic?
Following is the PDA that accept equal number of a and b.How can this be converted to DPDA? When stack top is Z,that it can read epsillon or a or b,which can create choic...
rahul sharma 5
2.3k
views
rahul sharma 5
asked
Nov 21, 2017
Theory of Computation
theory-of-computation
pushdown-automata
context-free-language
deterministic-context-free-grammars
+
–
0
votes
1
answer
4
Deterministic Context Free Languages
Qus: If L1=DCFL, L2= DCFL then L1-L2=? Sol: We can see from the above figure that DCFL’s are not closed under difference operation so L1-L2 = L3, is not a DCFL. The doubt is : Can we clearly say that L3 is not DCFL or L3 may be DCFL. Is it same for other languages as well?
Qus: If L1=DCFL, L2= DCFL then L1-L2=?Sol: We can see from the above figure that DCFL’s are not closed under difference operation so L1-L2 = L3, is not a DCFL.The doubt...
Shubham Kumar Gupta
429
views
Shubham Kumar Gupta
asked
Dec 24, 2017
Theory of Computation
context-free-language
deterministic-context-free-grammars
theory-of-computation
+
–
2
votes
0
answers
5
DCFL Inverse Homomorphism $H^{-1}(L)$ and Homomorphism $H(L)$ Closure ?
Hi Guys, Why is DCFL closed under Inverse Homomorphism $H^{-1}(L)$, But it not closed under Homomorphism $H(L)$ ?
Hi Guys,Why is DCFL closed under Inverse Homomorphism $H^{-1}(L)$, But it not closed under Homomorphism $H(L)$ ?
Chhotu
677
views
Chhotu
asked
Nov 19, 2017
Theory of Computation
theory-of-computation
homomorphism
deterministic-context-free-grammars
+
–
1
votes
1
answer
6
TOC DPDA vs NPDA
How many stacks are available with DPDA and NPDA? I assume it is 1 with DPDA and n with NPDA where n is some constant. Assume i have a language ,over alphabet a,b,c,dL=( W |n(a)=n(b) and n(c)=n(d) ),where n(a) is number if a in words. It is a CFL. Now can DPA handle this ?If yes,then how?If not,then why?
How many stacks are available with DPDA and NPDA? I assume it is 1 with DPDA and n with NPDA where n is some constant.Assume i have a language ,over alphabet a,b,c,dL=( W...
rahul sharma 5
2.0k
views
rahul sharma 5
asked
Jul 31, 2017
Theory of Computation
pushdown-automata
npda
theory-of-computation
context-free-language
deterministic-context-free-grammars
+
–
2
votes
1
answer
7
Decidability
Ambiguity of DCFL and CFL is decidable or not??
Ambiguity of DCFL and CFL is decidable or not??
Rahul Jain25
1.9k
views
Rahul Jain25
asked
Feb 7, 2017
Theory of Computation
decidability
theory-of-computation
context-free-language
deterministic-context-free-grammars
+
–
0
votes
1
answer
8
TOC DPDA
A DPDA can have dead configurations?? True/False. I think answer should be true bcoz DPDA requires that for a combination of top symbol and input at each state there is unique transition.
A DPDA can have dead configurations?? True/False.I think answer should be true bcoz DPDA requires that for a combination of top symbol and input at each state there is un...
Rahul Jain25
876
views
Rahul Jain25
asked
Feb 9, 2017
Theory of Computation
theory-of-computation
context-free-language
deterministic-context-free-grammars
+
–
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
