The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
86 views
Ques:- What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4).
asked in Theory of Computation by (165 points) | 86 views
0
i'm getting 3 final states. what is the correct answer?
0

@Ananya Jaiswal 1

how 3 final states??

0
yes you are correct 3 is the correct
0
How is it 3 states I am getting total of 7 states of which  4 final states, 2 non final and 1 trap state?(correct me if I am wrong)
0
I got clarified I made 2nd state (after accepting 1 a ) as final state which is wrong

1 Answer

+2 votes

see this dfa. let me know if i'm wrong

answered by Active (1.9k points)
0
1. Write transition table for congruent mod4

2. Apply complementation and then minimization


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,965 questions
45,466 answers
131,330 comments
48,381 users