...
Question 10303 – Theory-of-Computation
March 6, 2024
Question 7809 – Operating-Systems
March 6, 2024
Question 10303 – Theory-of-Computation
March 6, 2024
Question 7809 – Operating-Systems
March 6, 2024

Question 10323 – Theory-of-Computation

(a) Given a set
S = {x| there is an x-block of 5’s in the decimal expansion of π}
(Note: x-block is a maximal block of x successive 5’s)
Which of the following statements is true with respect to S? No reasons need to be given for the answer.

    (i) S is regular
    (ii) S is recursively enumerable
    (iii) S is not recursively enumerable
    (iv) S is recursive

(b) Given that a language L1 is regular and that the language L1 ∪ L2 is regular, is the language L2 always regular? Prove your answer.

Correct Answer: A

A
Theory Explanation.
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!