0 votes
1 answer
21
if L1,L2,.... are any recursively enumerable subsets of Σ*, then the union of Li's is Recursive enumerable.whether the above statement is true or false?
0 votes
0 answers
22
does the expression &A has l-value or not?iknow it will have r-value. but i think it will have l-value too. as in the scanf("%d",&A); isn't &A acting like l-value??pleas...
0 votes
0 answers
23
X belongs to {a,b}* such that n(a)<n(b)<2n(a) is a CFL. Please somebody explain the push and pop sequences of the alphabets on the stack. I'm not being able to visualise,...
0 votes
0 answers
24
What exactly does it means when we say that a particular string can be pumped or not in pumping lemma?,,.. and consequently what is the pumping length for a regular langu...
0 votes
0 answers
25
How can we say that any two disjoint co-turing recognisable languages are seperable by some Decidability language?
0 votes
0 answers
30
How the set of all non-decreasing functions from N to N are countable?How the set of all finite partitions of N are uncountable?