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

PyQdeckBEU PYQ Archive Subjects

Back to the 2024 paper

Module 1: Introduction & Regular Languages

20247m

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

Search Google Ask AI

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 THEORYConstruct 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.20257m Formal Language & Automata TheoryWhat is the minimum number of states in deterministic finite automata (DFA) for string starting with ba^2 and ending with a over alphabet \{a, b\}? (i) Ten (ii) Nine (iii) Eight (iv) Six20202m FORMAL LANGUAGE & AUTOMATA THEORYLet L \subseteq \{0,1,2\}^* be strings without consecutive identical symbols (no 00, no 11, no 22). Design a DFA for L.20227m

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.