Register

GATE practice question

• retagged by
353 views

1 Answer

1 votes
1 votes

L = {ai bj ck | i = j = k or i > 1000}

Lets divide this into 2 languages

L1 = {ai bj ck | i = j = k} and L2 = {ai bj ck | i > 1000}

Now clearly L1 is CSL and L2 is regular.

$\therefore$ L = L1 $\cup$ L2 , which will again be a CSL.

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

Related questions

0 votes
0 votes
1 answer
1
Ravi_1511 asked Nov 8, 2016
630 views
Gate Practice Question
An NFA has 11 states of which 5 are final .If we convert this NFA into DFA atmost how many states can be final states ?
An NFA has 11 states of which 5 are final .If we convert this NFA into DFA atmost how many states can be final states ?
User Avatar
0 votes
0 votes
1 answer
2
Ravi_1511 asked Nov 8, 2016
283 views
Gate practice question
True or false 1. b*a* intersection a*b* = a* union b* 2. If L is regular, the minimum state DFA for both L and ~L(complement) have same number of states.
True or false1. b*a* intersection a*b* = a* union b*2. If L is regular, the minimum state DFA for both L and ~L(complement) have same number of states.
User Avatar
0 votes
0 votes
2 answers
3
anupamsworld asked Aug 29, 2022
609 views
Identification of Regular Language | TOC | Practice Question | Unacademy Class
Which of the following is/are Regular? A] $\left \{ XWYW^{R} \space\ | \space\ W,X,Y \in \left \{ a,b \right \}^{+} \right \}$ ... D] None R => Reverse Please describe your answer.
Which of the following is/are Regular?A] $\left \{ XWYW^{R} \space\ | \space\ W,X,Y \in \left \{ a,b \right \}^{+} \right \}$B] $\left \{ WXW^{R}Y \space\ | \space\ W,X,Y...
User Avatar
0 votes
0 votes
1 answer
4
Hardik Maheshwari asked Jan 14, 2019
368 views
Practice Question
How to prove that $ (a+b)^*ab(a+b)^*+b^*a^* = (a+b)^*$
How to prove that $ (a+b)^*ab(a+b)^*+b^*a^* = (a+b)^*$
User Avatar
Link Copied!