Awesome q2a theme
0 votes
20 views
What will be the number of states in minimal DFA, if every string contains aa and bb as substring ?
in Theory of Computation by (6 points) | 20 views

1 Answer

0 votes

There will be 5 states in the dfa.

We need to check whether we can merge the final states here. Once it contains aa and bb as sub string then it will be accepted.

Hence there will be 4 states in the minimal DFA.

by (351 points)
edited by
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Apr 2020
  1. Kushagra गुप्ता

    36 Points

  2. !KARAN

    36 Points

  3. Ram Swaroop

    36 Points

  4. sushmitagoswami

    6 Points

  5. MelinaCundif

    5 Points

  6. Lolita04I641

    5 Points

  7. JackiBandy49

    5 Points

  8. skbansal97

    5 Points

  9. lazygatestudent

    5 Points

  10. AngeloAlba89

    5 Points

3,521 questions
1,658 answers
10,461 comments
90,043 users