Register
Filter

Questions by aaru14

1 votes
1 answer
61
made easy work book
how many strings of at most 4 bits that start with and end with "0" belongs to the language described by (01+10)* 0 (0+1)* ?? please give explanation..
how many strings of at most 4 bits that start with and end with "0" belongs to the language described by (01+10)* 0 (0+1)* ?? please give explanation..
1 votes
2 answers
62
made easy work book
the regular expression is given by R=( ab|abb)* bbab which of the following does not belong to R?? a) ab ab ab b) ab bb ab c) ababbabbbab d) abbabbbab
the regular expression is given by R=( ab|abb)* bbab which of the following does not belong to R??a) ab ab abb) ab bb abc) ababbabbbabd) abbabbbab
0 votes
1 answer
63
made easy theory book
Let r1= (b* ab* ab* ab*)*, r2= (b* ab* ab*)* what is L(r1) intersection L(r2)???
Let r1= (b* ab* ab* ab*)*, r2= (b* ab* ab*)* what is L(r1) intersection L(r2)???
1 votes
1 answer
64
Regular language
let L1 =a*b* and L2 = {ab} L3 = prefix (L1* intersection L2) where prefix(L) = { u| uv belongs L for any v} find the number of strings in L3????
let L1 =a*b* and L2 = {ab} L3 = prefix (L1* intersection L2)where prefix(L) = { u| uv belongs L for any v} find the number of strings in L3????
1 votes
3 answers
65
michael sipser
draw dfa {w|w is any string not in a*b*} ????
draw dfa{w|w is any string not in a*b*}????
0 votes
3 answers
66
MadeEasy Subject Test: Algorithms - Time Complexity
for an O(log n) algorithum , x takes 12 second to execute his data Y runs the same algorithum on same machine and it took him 20 sec for data size 32 the data size of X is ????
for an O(log n) algorithum , x takes 12 second to execute his data Y runs the same algorithum on same machine and it took him 20 sec for data size 32 the data size of X i...
0 votes
1 answer
67
MadeEasy Subject Test: Algorithms - Asymptotic Notations
hello sir i have doubt in this question. T(n) >= 2T(n/2) + theta(n) option are: O(n log n) omega(n log n) theta (n log n) how we to select which sign i have to use omega ,big oh ,theta ??????
hello sir i have doubt in this question.T(n) >= 2T(n/2) + theta(n)option are:O(n log n)omega(n log n)theta (n log n)how we to select which sign i have to useomega ,big oh...
Page: