Register

MadeEasy Test Series 2018: Theory of Computation - Identify Class Language

• edited by
454 views
2 votes
2 votes

a) Only L1 is correct

b)Only L2 is correct

c)Both L1 and L2 are correct

d)None of L1 and L2 is correct

My question is: What is meant by prefix of string? And how is L1 regular?

• edited by
User Avatar

1 Answer

0 votes
0 votes
DFA can be drawn for the first  Language L1 and so the language is regular.

L1 will have finite no. of strings in the language .

L1= { € ,a ,aa, b, bb , ab , aab , aabb , aabbb,  aabbbb }

Language second is clearly a cfl language .

L2 can be written as -

L2= (€ + a + aa)(a^n b^n)  

(Second part is the standard example of cfl language)

[   ' € '   represents null string   ]
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
5 answers
4
air1ankit asked Dec 9, 2017
846 views
MadeEasy Test Series: Theory Of Computation - Identify Class Language
If L1 = { a^n | n ≥ 0 } and L2 = { b^n | n ≥ 0 }, Consider then L1 . L2 wil be a) (ab)^n b) a^n b^n c) b^n a^n d)b^m a^n e) { a^m b^n | m ≥ 0, n ≥ 0 } why answer is d why not b ????
If L1 = { a^n | n ≥ 0 } and L2 = { b^n | n ≥ 0 }, Considerthen L1 . L2 wil bea) (ab)^nb) a^n b^nc) b^n a^nd)b^m a^ne) { a^m b^n | m ≥ 0, n ≥ 0 }why answer is d w...
User Avatar
Link Copied!