GATE CSE · 2024 · CS1
Question 59: Theory of Computation
Give it a try, then reveal the answer to check your work.
Question 59
CS1NAT2 marksNeeds review
Let
be a context-free grammar in Chomsky Normal Form with
and
containing 10 variable symbols including the start symbol
. The string
is derivable from
. The number of steps (application of rules) in the derivation
is ________Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerEXPLORE & PRACTISE
Paper and topic context
See where this question comes from and choose what to practise next.
2024CS1
GATE CSE 2024 · Paper 1
Computer Science and Information Technology · Original paper archive
- Section
- Section CS1
- Question type
- Numerical answer (NAT)
- Marks
- 2 marks
Practise related topics
Explore more previous year questions using this question’s imported topic tags.
computer science
GATE CSE previous year questions
information technology
GATE CSE previous year questions
computing
GATE CSE previous year questions
theory computation
GATE CSE previous year questions
context free grammars
GATE CSE previous year questions
Theory of Computation
GATE CSE previous year questions
Comments
Ask a question, share your approach, or help someone understand.
Log in to view the discussion
You’re not logged in. Log in or create an account to see discussions and add comments.