501 views
0 0 votes

Question:

L1 = { ambn | m≠n  and m,n> 0 }

L2 = b*a*

Let L = L1 U L2 and L3  is compliment of L.

Select the correct option:

A) L is CFL but not DCFL and  L3 is not CFL.

B) Both L and  L3 are CFL but not DCFL.

C) L is DCFL but not regular and L3 is not DCFL.

D) Both L and  L3 are DCFL but not regular.

1 Answer

Position:
Show:

Related questions

0 0 votes
0 0 answers
604
604 views
Pavan Shetty asked Nov 17, 2018
604 views
Can someone please explain how and what above PDA is computing
0 0 votes
0 0 answers
319
319 views
mehul vaidya asked Sep 9, 2018
319 views
Is below statement true or false?The set of turning machines which do not halt on empty input forms a recursively enumerable set.Here is what i understandthere is TM whic...
1 1 vote
0 0 answers
929
929 views
Tuhin Dutta asked Dec 4, 2017
929 views
why $bb^*$ is $b^*$ and not $b^+$?Ref:$a^*(bb^*a + a)a^*\\=a^*(bb^*+\epsilon)aa^*\\=a^*b^*aa^*\\=a^*b^*a^*a$
1 1 vote
2 2 answers
1.8k
1.8k views
Parshu gate asked Nov 29, 2017
1,789 views
Suppose in question we are given the language is Turing Recognizable , can I consider it a CFL or Regular?