Register
Filter

Questions by Aditya

1 votes
1 answer
1
No of BST ?
7 votes
1 answer
4
Can Regular Grammar be ambiguous ?
1 votes
1 answer
5
Please post the DFA for the language.
What are the number of final states in minimal DFA, where $\Sigma = \{a,b\}$, if every string starts with "aa" and length of string is not congruent to 0 mod 4? 7 6 3 5
What are the number of final states in minimal DFA, where $\Sigma = \{a,b\}$, if every string starts with "aa" and length of string is not congruent to 0 mod 4?7635
1 votes
2 answers
6
What does R represent here ?
Q). Let $A= (a+b)^*ab(a+b)^*,B=a^*b^*$ and $ C=(a+b)^*$ .Then the relation between $A,B$ and $C$ is: A). $A+B=C$ B). $A^R+ B^R =C$ C). $A^R +B=C$ D). None
Q). Let $A= (a+b)^*ab(a+b)^*,B=a^*b^*$ and $ C=(a+b)^*$ .Then the relation between $A,B$ and $C$ is:A). $A+B=C$B). $A^R+ B^R =C$C). $A^R +B=C$D). None
0 votes
1 answer
7
Rice Theorem
1 votes
2 answers
8
Type of language ?
it will be accepted by NPDA. Right ??
it will be accepted by NPDA. Right ??