PyQdeck LogoPyQdeckSubjects
Back to the 2024 paper

Module 1: Introduction & Regular Languages

20242m

Which of the following is a type of grammar in the Chomsky hierarchy?

(i) Regular
(ii) Context-Free
(iii) Context-Sensitive
(iv) All of the above

Search GoogleAsk AI

Similar questions

FORMAL LANGUAGE & AUTOMATA THEORYRegular languages belong to which type in the Chomsky hierarchy? (i) Type-0 (ii) Type-2 (iii) Type-1 (iv) Type-320252mFORMAL LANGUAGE & AUTOMATA THEORYDiscuss the Chomsky hierarchy of grammars with suitable examples.20237mFORMAL LANGUAGE & AUTOMATA THEORYTabulate the Chomsky hierarchy of grammars with an example of each.20247mFormal Language & Automata TheoryTabulate Chomsky hierarchy of grammar with an example for each.20217m
PreviousA DFA can have: (i) Multiple start states (ii) Multiple accepting states (iii) Transitions on \varepsilon (iv) None of the aboveNextA Turing Machine has: (i) A finite tape (ii) An infinite tape (iii) A stack (iv) A queue