The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+13 votes
515 views

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\} $
asked in Theory of Computation by Veteran (68.8k points)
edited by | 515 views

2 Answers

+17 votes
Best answer

DFA for A:

Part (B):

 

answered by Boss (8.5k points)
selected by
+14 votes

DFA for (B)

answered by Veteran (48.6k points)
edited by
q3 will be final.

q1 is for odd no of a's and even no of b's as it accepting a, bba, etc.
Updated.


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

32,620 questions
39,267 answers
109,739 comments
36,656 users