900 views

1 Answer

2 2 votes
Just wait one more day,
Gateoverflow will publish it's key.
From the last couple of years it has been 95-98% accurate.
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
518
518 views
Akshatgupta0698 asked Oct 1, 2024
518 views
If every Regular Language L satisfies pumping lemma, then how can we prove that language L = {a,b} satisfies pumping lemma. Reg Exp (L) = a+b
0 0 votes
1 1 answer
1.2k
1.2k views
SÀRÁTH_2003 asked Jan 7, 2022
1,184 views
#include<stdio.h>Int main(void){Int a=printf("%d",printf("%d %d",printf("GATE"),printf("OVERFLOW")));printf("%d",a);return 0;}What is the reason for different output?Expl...
0 0 votes
1 answers 1 answer
3.1k
3.1k views
MIRIYALA JEEVAN KUMA asked Nov 4, 2018
3,108 views
Here is a famous problem: N guests arrive at a party. Each person is wearing a hat. We collect all hats and then randomly redistribute the hats, giving each person one of...
0 0 votes
0 0 answers
942
942 views
sudharshan asked Oct 27, 2018
942 views
can we say that every regular language is a DCFL?