Register

#GATE

247 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Gate questionsNext → · Peter Linz, 5th Edit...
← Previous in category · Gate questionsNext in category → · Peter Linz, 5th Edit...
Position:
Show:

Related questions

0 0 votes
1 1 answer
567
567 views
Dknights asked Sep 12, 2023
567 views
#Gate CS Applied Course
is this correct DFA ?
3 3 votes
2 2 answers
1.4k
1.4k views
Rajesh Reddy asked Jan 3, 2022
1,407 views
#Gate CS Applied Course Mock Test
Is this Language a CFL?If yes, Can you please explain the implementation.
0 0 votes
1 1 answer
566
566 views
amit166 asked Jan 28, 2023
566 views
#gate questions
which one true1. Determining whether context-free grammar is un-decidable2. Whether a given grammar is context-free is decidable
0 0 votes
0 0 answers
541
541 views
BHOJARAM asked Jan 14, 2019
541 views
#gate
$L_1=\{a^m b^m c a^n b^n | m,n>=0\}$$L_2=\{a^i b^j c^k | i, j,k >=0\}$Then $L_1 \cap L_2$ = $\{a^m b^m c\}$ or $\{a^n b^n c\}$ or $\{a^i b^i c\}$ or $\{a^j b^j c\}$Which...