The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+18 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\} $
asked in Theory of Computation by Veteran (59.5k points)
edited by | 651 views
what if the remaining input will stand or loop within the instead of giving b as back input let its loop there itself...............and same do for all????????

2 Answers

+19 votes
Best answer

DFA for A:

Part (B):

answered by Loyal (8.2k points)
edited by
+15 votes

DFA for (B)

answered by Boss (42.5k 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.

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

37,111 questions
44,694 answers
43,753 users