Time Left - 06:00 mins
BARC CS 2018 Nuclear Quiz -3 (TOC)
Attempt now to get your rank among 970 students!
Question 1
Find the equivalent regular expression generated by the above grammar G.
Question 2
A language over ∑ (a,b)* ,all strings are palindrome, has grammar where ε is not included in grammar[ means ‘ S->ε ‘ not available ]
Then which is true ?
Then which is true ?
Question 3
What is not a regular expression for one or more a?
Question 4
Consider the following problem X.
Given a Turing machine M over the input alphabet Σ, any state q of M
And a word w ∈Σ*, does the computation of M on w visit the state q?
Which of the following statements about X is correct?
Given a Turing machine M over the input alphabet Σ, any state q of M
And a word w ∈Σ*, does the computation of M on w visit the state q?
Which of the following statements about X is correct?
Question 5
If a language is recursive then it is
- 970 attempts
- 2 upvotes
- 10 comments
Mar 25GATE & PSU CS