Construct DFA that accepts strings over \Sigma = \{a,b\} which start w

Back to the 2024 paper

Module 1: Introduction & Regular Languages

20247m

Construct DFA that accepts strings over $\Sigma = \{a,b\}$ which start with $aba$ .

Similar questions

FORMAL LANGUAGE & AUTOMATA THEORYDesign a DFA for strings over \{a, b\} containing at least three occurrences of bbb (overlapping allowed). Example: bbbbbb is accepted.20227m Formal Language & Automata TheoryDesign deterministic finite automata for the set of strings over the alphabet \{a, b\} containing at least three occurrences of three consecutive b's, overlapping permitted (e.g., the string bbbbb should be accepted).20197m FORMAL LANGUAGE & AUTOMATA THEORYConstruct DFA for all strings over \{0,1\} interpreted as binary numbers divisible by 4.20247m Compiler DesignConvert the regular expression (a+b)^*ab into NFA.20257m

PreviousConstruct DFA for all strings over \{0,1\} interpreted as binary numbers divisible by 4.NextProve that L = \{ a^i b^i \mid i \ge 0 \} is not regular using the pumping lemma.

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.

Get on Google Play