Back to the 2025 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYState the pumping lemma for context-free languages.20237mFormal Language & Automata TheorySuppose L is context free and R is regular, justify your answer with the help of example: (i) Is L-R necessarily context free? (ii) Is R-L necessarily context free?202114mFormal Language & Automata TheoryProve that the language L = \{a^{i^2} \mid i \ge 1\} is not context-free language.20197mFormal Language & Automata TheoryExplain Linear Bounded Automata and its relationship with Context-Sensitive Languages.20257m
PreviousConstruct an NFA that accepts all strings over the alphabet {0, 1, 2} that begin with one or more 0s, followed by an odd number of 1s, and end with any number of 2s.NextGiven the following context-sensitive grammar: S \rightarrow aSBC | abc CB \rightarrow BC aB \rightarrow ab bB \rightarrow bb bC \rightarrow bc cC \rightarrow cc Identify the language generated by the grammar. Derive the string aabbcc step by step.
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.