631 views
3 votes
3 votes
S = { < R > | R is a regular expression describing a language containing at least one string w has 111 as a substring (i.e., w = x111y for some x ans y)}. Then what will be S -

a) decidable

b) undecidable

c) Recursive enumerable

d) Turing unrecognizable

1 Answer

Related questions