Back to the 2022 paper
Module 1: Introduction, Regular languages and finite automata
20227m
Minimize the DFA shown in the following transition diagram:
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYGiven a DFA D over the alphabet {a, b}, perform DFA minimization and draw the equivalent minimal DFA accepting the same language. 20257mFORMAL LANGUAGE & AUTOMATA THEORYWrite short notes on: 1. Minimization of DFA 2. Type 2 grammar (Context-Free Grammar)20247mFORMAL LANGUAGE & AUTOMATA THEORYConvert the following NFA to DFA. 20247mFormal Language & Automata TheoryWrite a short note on: Minimization of finite automata20257m
PreviousConstruct the regular grammar accepting the following language: L = \{ w \in \{a, b\}^* / w \text{ is a string over } \{a, b\} \text{ such that the number of b's is } 3 \pmod 4 \}NextDefine recursively enumerable languages. Let L_1 be recursive and L_2 recursively enumerable. Show that L_2 - L_1 is necessarily recursively enumerable.
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.