The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
66 views

asked in Theory of Computation by Loyal (6.3k points) | 66 views

1 Answer

0 votes

To be sure of correct answer, better first convert the given NFA into equivalent DFA and then minimize (if required).

Here, The number of states in Minimized DFA will be = $6$ States

answered by Boss (24.1k points)
0

I am getting this minimised dfa then after minimization 

0
How 2,3,4 are merged ?
0

I got this table 

0

How 2,3,4 are merged ?

Because of $\in \,\,closure$ of state $1$  on $a$.

I got this table

Please verify..some mistake is there. 

Related questions

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
49,408 questions
53,589 answers
185,806 comments
70,871 users