Design deterministic finite automata for the set of strings over the a

Back to the 2019 paper

Module 1: Introduction, Regular languages and finite automata

20197m

Design 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).

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 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 Compiler DesignChoose the correct option / answer the following: Which of the following is NOT accepted by finite automata? (i) Palindromes (ii) Strings with even number of a's (iii) Binary strings divisible by 3 (iv) Strings ending with 'ab'20242m 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

PreviousLet N be an NFA with n states and let M be the minimized DFA with m states recognizing the same language. Which of the following is necessarily true? (i) m \le 2^n (ii) n \le m (iii) M has one accept state (iv) m = 2n NextLet \Sigma = \{0, 1\}. Let L be the language that consists of strings having either 01 repeated one or more times or 010 repeated one or more times. Is L regular? Explain.