Register
Filter

Answers by yogi_p

1 votes
2
computer network
what is differential equation in this
what is differential equation in this
1 votes
3
ER model
2 votes
4
Relational Algebra
5 votes
5
madeeasy work book
S-->aSa|bSb|a|b|epsilon for above CFG find the total no of strings generated whose length is less than or equal to 10 [excluding the empty string] ?
S >aSa|bSb|a|b|epsilonfor above CFG find the total no of strings generated whose length is less than or equal to 10 [excluding the empty string]?
1 votes
8
NET Aug 16 paper-III Q 55
1 votes
9
regular languages
A / B = { w | wx ∈ A for some x ∈ B }. Show that if A is regular and B is any language, then A / B is regular.
A / B = { w | wx ∈ A for some x ∈ B }. Show that if A is regular and B is any language, then A / B is regular.
0 votes
10
regular languages
A = { 0k1u0k | k >=1 and u ∈ ∑* }. Is A is regular ?
A = { 0k1u0k | k >=1 and u ∈ ∑* }. Is A is regular ?
0 votes
11
decidability
A = { <M> | M is a DFA that accepts some string with more 1s than 0s }. Then A is - a) undecidable b) recursive enumerable c) decidable d) none of the above
A = { <M | M is a DFA that accepts some string with more 1s than 0s }. Then A is - a) undecidable b) recursive enumerablec) decidabled) none of the above
0 votes
12
Regular Expression
What is the regular expression for all strings over {0, 1} not containing the substring 101?
What is the regular expression for all strings over {0, 1} not containing the substring 101?
1 votes
13
Decidability
True/False? The complement of every Turning decidable language is Turning decidable
True/False? The complement of every Turning decidable language is Turning decidable