Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Ankit Garg 2
2
answers
1
Test by Bikram | Theory of Computation | Test 2 | Question: 5
Given two regular expressions: $p = (0^* 1^* )^*$ and $q = 0^* + 1^* + 0^*1 + 10^*$ The length of the smallest string that is present in the language corresponding to regular expression ‘$p$’ and not present in the language corresponding to regular expression ‘$q$’ is ________.
Given two regular expressions:$p = (0^* 1^* )^*$ and $q = 0^* + 1^* + 0^*1 + 10^*$The length of the smallest string that is present in the language corresponding to reg...
731
views
commented
Nov 30, 2018
Theory of Computation
tbb-toc-2
numerical-answers
theory-of-computation
regular-expression
+
–
0
answers
2
Tower of Hanoi Please explain this question
371
views
asked
Nov 26, 2018
DS
towers-of-hanoi
+
–
1
answer
3
GATE 19 Test Series
What are some reliable and good test-series for GATE CSE 19'? Also, how many of them should I join considering that I spend the last two months of my preparation on them?
What are some reliable and good test-series for GATE CSE 19'?Also, how many of them should I join considering that I spend the last two months of my preparation on them?
1.5k
views
commented
Nov 20, 2018
GATE
usergate2019
usermod
test-series
preparation
+
–
5
answers
4
GATE CSE 2014 Set 3 | Question: 15
The length of the shortest string NOT in the language (over $\Sigma = \{a, b\})$ of the following regular expression is _______. $a^*b^*(ba)^*a^*$
The length of the shortest string NOT in the language (over $\Sigma = \{a, b\})$ of the following regular expression is _______.$$a^*b^*(ba)^*a^*$$
13.9k
views
commented
Sep 17, 2018
Theory of Computation
gatecse-2014-set3
theory-of-computation
regular-expression
numerical-answers
easy
+
–
2
answers
5
GATE CSE 1999 | Question: 1.4
Consider the regular expression $(0 + 1) (0+1) \dots N$ times. The minimum state finite automaton that recognizes the language represented by this regular expression contains $n$ states $n+1$ states $n+2$ states None of the above
Consider the regular expression $(0 + 1) (0+1) \dots N$ times. The minimum state finite automaton that recognizes the language represented by this regular expression cont...
25.4k
views
commented
Sep 17, 2018
Theory of Computation
gate1999
theory-of-computation
finite-automata
easy
minimal-state-automata
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register