Register

CFL and regular language

• edited by
250 views
0 votes
0 votes
Consider a regular language R  and a context free language C.  Let the PDA  that recognizes C  be called P=(QP,∑,Γ,δP,q0P,FP),  and the DFA that reconginzes R  be (QR,∑,δR,q0R,FR).
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2.1k
views
2 answers
4 votes
amrendra pal asked Aug 27, 2017
2,119 views
regular and CFL language
Let A and B be two languages over alphabet ∑ . which of the following are true ? (more than one options may be correct)(a) if A is regular and B is CFL then A∩B is ... CFL.(d) if A is not CFL and B is CFL then A∪B will not be a CFL.
User Avatar
11.1k
views
3 answers
3 votes
sunil sarode asked Jul 11, 2017
11,127 views
Following language: L = {a^n b^n c^n d^n , n ≥ 1} ,How it is CSL and not CFL?
My understanding :We can create PDA as followsfor every 'a' push operation and on 'b' pop operation and again on 'c' push operation and on seeing 'd' pop operation. ... , if i am wrong.I am sorry, if it is not important.Thanks lot :)
User Avatar
1.3k
views
3 answers
2 votes
jugnu1337 asked Dec 23, 2021
1,301 views
regular and cfl
if L1 and L2 are not regular language then L1 union L2 is not regular.this statement is true or false?my approach is:::true let suppose L1= a^n b^n ... then that also be cfland what happened if union is replaced by concatenation L1 . L2
User Avatar
792
views
2 answers
1 votes
Parshu gate asked Dec 10, 2017
792 views
Regular and CFL
LC may be CFL LC cannot be CFL LC may be regular LC may or may not be CFL
User Avatar
Link Copied!