GATE CSE · 2018 · CS
Question 52: Theory of Computation
Give it a try, then reveal the answer to check your work.
Question 52
CSNAT2 marksNeeds review
Given a language
, define
as follows:
for all
The order of a language
is defined as the smallest k such that
. Consider the language
(over alphabet 0) accepted by the following automaton.The order of
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.
2018CS
GATE CSE 2018 · Paper 1
Computer Science and Information Technology · Original paper archive
- Section
- Computer Science and Information Technology
- 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
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.