Register
Filter

Questions by Kaluti

2 votes
1 answer
121
self doubt
The min of a language L is defined as min(L) = { w $\epsilon$ L : there is no u $\epsilon$ L, v $\epsilon$ $\sum$*, such that w = uv }. Show that the family of regular languages is closed under the min operation.
The min of a language L is defined asmin(L) = { w $\epsilon$ L : there is no u $\epsilon$ L, v $\epsilon$ $\sum$*, such that w = uv }. Show that the family of regular lan...
0 votes
0 answers
122
self doubt
Define the operation leftside on L by leftside(L) = { w : w wR $\epsilon$ L }. Is the family of regular languages closed under this operation?
Define the operation leftside on L byleftside(L) = { w : w wR$\epsilon$ L }.Is the family of regular languages closed under this operation?
0 votes
0 answers
123
self doubt
For a string a1 a2 ... an define the operation shift as shift(a1 a2 ... an) = a2 ... an a1. From this, we can define the operation on a language as shift(L) = { v : v = shift(w) for some w $\epsilon$ L }. Show that regularity is preserved under the shift operation.
For a string a1 a2 ... an define the operation shift asshift(a1 a2 ... an) = a2 ... an a1.From this, we can define the operation on a language asshift(L) = { v : v = shif...
0 votes
0 answers
124
self doubt
The head of a language is the set of all prefixes of its strings, that is, head(L) = { x : xy $\epsilon$ L for some y $\epsilon$ $\sum$^(*) }. Show that the family of regular languages is closed under this operation.
The head of a language is the set of all prefixes of its strings, that is,head(L) = { x : xy $\epsilon$ L for some y $\epsilon$ $\sum$^(*) }.Show that the family of regul...
0 votes
0 answers
125
self doubt
Let L be a regular set. Then the set third(L) = {third(w) : w $\epsilon$ L } is also a regular set. prove this
Let L be a regular set. Then the set third(L) = {third(w) : w $\epsilon$ L } is also a regular set. prove this
0 votes
0 answers
126
self doubt
is the following true if L1 and L1.L2 are regular so is L2 ? here? explain
is the following true if L1 and L1.L2 are regular so is L2 ? here? explain
0 votes
0 answers
127
self doubt
Define an operation third on strings and languages as third(a1 a2 a3 a4 a5 a6 ...) = a3 a6 ... with the appropriate extension of this definition to languages. Prove the closure of the family of regular languages under this operation.
Define an operation third on strings and languages asthird(a1 a2 a3 a4 a5 a6 ...) = a3 a6 ... with the appropriate extension of this definition to languages. Prove the cl...
0 votes
0 answers
128
self doubt
Let L be any language. Define even(w) as the string obtained by extracting from w the letters in even-numbered positions; that is, if w = a1 a2 a3 a4 ... then even(w) a2 a4 ... Corresponding to this, we can define a language even(L) = {even(w) : w $\epsilon$L}. Prove that if L is regular, so is even(L).
Let L be any language. Define even(w) as the string obtained by extracting from w the letters in even-numbered positions; that is, ifw = a1 a2 a3 a4 ...theneven(w) a2 a4 ...
0 votes
0 answers
129
self doubt
find no of primes not exceeding 100 by inclusion exclusion principle
find no of primes not exceeding 100 by inclusion exclusion principle
2 votes
1 answer
130
self doubt
what is cantor's theorem and diagonalization theorem
what is cantor's theorem and diagonalization theorem
0 votes
0 answers
131
self doubt
We then define the shuffle of two languages A and B as S(A, B) = {w|∃ u ∈ A, v ∈ B s.t. w is a shuffle of u and v} Show that if A and B are regular languages over a common alphabet Σ, then so is S(A, B).
We then define the shuffle of two languages A and B as S(A, B) = {w|∃ u ∈ A, v ∈ B s.t. w is a shuffle of u and v}Show that if A and B are regular languages over a ...
1 votes
2 answers
132
self doubt
how many subsets of a set with 100 elements have more than one element? answer should be 2^(100)-1 ot it should be 2^(100)-101 which one correct?
how many subsets of a set with 100 elements have more than one element?answer should be 2^(100)-1 ot it should be 2^(100)-101 which one correct?
0 votes
0 answers
133
self doubt
how many among the first 500,000 positive integer contain exactly one of each 3 , 4 and 5 in their decimal representation
how many among the first 500,000 positive integer contain exactly one of each 3 , 4 and 5 in their decimal representation
0 votes
2 answers
134
self doubt
B = {1ky | y is in {0, 1}* and y contains at least k 1s, for k >= 1} explain it is regular or not ?
B = {1ky | y is in {0, 1}* and y contains at least k 1s, for k >= 1}explain it is regular or not ?
0 votes
0 answers
136
SELF DOUBT
Explain isomorphism in context of groups with example
Explain isomorphism in context of groups with example
1 votes
0 answers
137
self doubt
Turing machine halts exactly n steps would it be decidable or undecidable (re or non re) ?
Turing machine halts exactly n steps would it be decidable or undecidable (re or non re) ?
1 votes
0 answers
138
self doubt
explain PCP and MPCP problem with example?
explain PCP and MPCP problem with example?
1 votes
1 answer
139
self doubt
a vessel contains mixture of milk and water in which water concentration is 30 percent .if 20 percent water and 30 percent milk is taken out and replaced with equal quantity of water , then quantity of water increases by what percent of initial of water in the mixture?
a vessel contains mixture of milk and water in which water concentration is 30 percent .if 20 percent water and 30 percent milk is taken out and replaced with equal ...
2 votes
1 answer
140
self doubt
273xy is divisible by 80 then what will be value of (x + y) ?
273xy is divisible by 80 then what will be value of (x + y) ?
Page: