Google Interview Question for Software Engineer/Developer about Terminology

(3 posts)

Tags:

robin
guest
Posted 1 year ago #

For any string s ∈ (0 + 1)*, let d(s) denote the decimal value of s
(eg: d(101) = 5, d(011) = 3).
Let L = {s ∈ (0+1)* | d(s) mod 5 = 2 and d(s) mod 7 = 4}. Which of the
following statements is true?
a) L is recursively enumerable, but not recursive
b) L is is recursive, but not context-free
c) L is context-free, but not regular
d) L is regular
Ajay
guest
Posted 1 year ago #

Please some one post the answer for this.. or atleast explain the meaning of options B-)
elenashutova
Member
Posted 1 year ago #

I don't know the answer, but these topics are covered here:
http://en.wikipedia.org/wiki/Context-free_grammar
http://en.wikipedia.org/wiki/Context-free_languages

Reply

You must log in to post.