Back to the 2025 paper
Module 1: Introduction & Regular Languages
20257m
Given a DFA D over the alphabet {a, b}, perform DFA minimization and draw the equivalent minimal DFA accepting the same language. 
Similar questions
Formal Language & Automata TheoryMinimize the DFA shown in the following transition diagram: 20227mFORMAL LANGUAGE & AUTOMATA THEORYWrite short notes on: 1. Minimization of DFA 2. Type 2 grammar (Context-Free Grammar)20247mFormal Language & Automata TheoryConvert the regular expression (a + b)abb(a + b) into an equivalent DFA. Show all steps.20257mFormal Language & Automata TheoryWrite a short note on: Minimization of finite automata20257m
PreviousGiven the regular expression: (0+1)^*01(0+1) Describe the language generated, and construct an equivalent DFA.NextUse the pumping lemma to prove that the language L = \{a^n b^n : n \ge 1\} is not regular.
Official AppAndroid App
PYQDeck for Android
Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.