PyQdeck LogoPyQdeckSubjects
Back to the 2025 paper

Module 1: Introduction & Regular Languages

20252m

Regular languages belong to which type in the Chomsky hierarchy?

(i) Type-0
(ii) Type-2
(iii) Type-1
(iv) Type-3

Search GoogleAsk AI

Similar questions

FORMAL LANGUAGE & AUTOMATA THEORYWhich of the following is a type of grammar in the Chomsky hierarchy? (i) Regular (ii) Context-Free (iii) Context-Sensitive (iv) All of the above20242mFormal Language & Automata TheoryExplain Chomsky Hierarchy of languages with examples of each type and their corresponding automata.20257mFORMAL LANGUAGE & AUTOMATA THEORYExplain the Chomsky hierarchy of languages with examples.20257mFORMAL LANGUAGE & AUTOMATA THEORYTabulate the Chomsky hierarchy of grammars with an example of each.20247m
PreviousA language is said to be recursively enumerable if it is accepted by a (i) DFA (ii) Turing Machine (iii) PDA (iv) Linear Bounded AutomatonNextWhich of the following languages is NOT regular? (i) {a^n b^n | n \ge 0} (ii) {a, b}* (iii) Finite languages (iv) Languages accepted by DFA