11 votes
1
Given below are two finite state automata ( $\rightarrow$ indicates the start state and $F$ indicates a final state)$$\overset{Y}{\begin{array}{|l|l|l|}\hline \text{} & ...
1 votes
2
Below DFA is accepting above regular language but it is accepting null also....can anyone please give correct DFA
2 votes
4
Minimum state Finite Automata recognizing the language corresponding to following Regular Expression(0*10+1*0)(01)* a)3 b)4 c)2 d)5Also please show Finite Automata for it...
0 votes
5
Minimum state Finite Automata recognizing the language corresponding to following Regular Expression(0*10+1*0)(01)* a)3 b)4 c)2 d)5Also please show Finite Automata for it...
2 votes
6
What will be output of following program?#include<stdio.h>int main(){ int a = 320; char *ptr; ptr =( char *)&a; printf("%d ",*ptr); return 0;}(A) 2(B) 320(C) 64...