Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
aayushranjan01
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by aayushranjan01
11
votes
1
GATE CSE 2008 | Question: 49
Given below are two finite state automata ( $\rightarrow$ indicates the start state and $F$ ...
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{} & ...
14.5k
views
answered
Nov 4, 2015
Theory of Computation
gatecse-2008
normal
theory-of-computation
finite-automata
+
–
1
votes
2
DFA for 00+11+(01+10)(00+11)*(01+10)
Below DFA is accepting above regular language but it is accepting null also....can anyone please give correct DFA
Below DFA is accepting above regular language but it is accepting null also....can anyone please give correct DFA
8.1k
views
answered
May 21, 2015
1
votes
3
pointer arithmatic
#include <stdio.h> int main(void) { static char s[25]="TheCocaine Man"; int i=0; char ch; ch=s[++i]; printf("%c",ch); ch=s[i++]; printf("%c \n",ch); ch=i++[s]; printf("%c\n",ch); ch=++i[s]; printf("%c ",ch); return 0; } how last ch print D?is ++i[s] incremet index or value?
#include <stdio.h>int main(void) { static char s[25]="TheCocaine Man"; int i=0; char ch; ch=s[++i]; printf("%c",ch); ch=s[i++]; printf("%c \n"...
865
views
answered
May 1, 2015
2
votes
4
Minimum No of states in Finite Automata
Minimum state Finite Automata recognizing the language corresponding to following Regular Expression (0*10+1*0)(01)* a)3 b)4 c)2 d)5 Also please show Finite Automata for it.
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.8k
views
answered
Apr 30, 2015
0
votes
5
Minimum No of states in Finite Automata
Minimum state Finite Automata recognizing the language corresponding to following Regular Expression (0*10+1*0)(01)* a)3 b)4 c)2 d)5 Also please show Finite Automata for it.
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.8k
views
answered
Apr 30, 2015
2
votes
6
c programming
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 (D) Compilation error (E) None of above
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...
2.0k
views
answered
Apr 30, 2015
1
votes
7
NFA for the language, L= (ab, ba)* would have how many states?
8.2k
views
answered
Apr 29, 2015
Theory of Computation
theory-of-computation
finite-automata
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register