edited by
5,266 views
36 votes
36 votes

Construct DFA's for the following languages:

  1. $L=\left\{w \mid w \in \{a,b\}^*, \text{ w has baab as a substring } \right\}$
  2. $L=\left\{w \mid w \in \{a,b\}^*,  \text{ w has an odd number of a's and an odd number of b's } \right\} $
edited by

2 Answers

Best answer
38 votes
38 votes

DFA for A:

Part (B):

edited by
16 votes
16 votes

DFA for (B)

edited by

Related questions

29 votes
29 votes
3 answers
1
Kathleen asked Sep 14, 2014
15,790 views
Given an arbitrary non-deterministic finite automaton (NFA) with $N$ states, the maximum number of states in an equivalent minimized DFA at least$N^2$$2^N$$2N$$N!$
41 votes
41 votes
4 answers
4
Kathleen asked Sep 14, 2014
18,435 views
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of s...