The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+1 vote

asked in Theory of Computation by Junior (763 points)
retagged by | 43 views

2 Answers

+1 vote

The given NFA is itself DFA. So, Just apply DFA minimization algorithm on the given DFA.

Various DFA minimization algorithms could be used But let me use the most convenient one that I feel :

DFA Minimization using Equivalence Theorem :

0-equivalent : $\left \{ q_\lambda,q_0,q_1,q_{00},q_{01},q_{10} \right \} \left \{ q_{11} \right \}$

1- equivalent : $\left \{ q_\lambda,q_0,q_{00},q_{10} \right \} \left \{ q_1,q_{01} \right \} \left \{ q_{11} \right \}$

2-equivalent : $\left \{ q_\lambda,q_0,q_{00},q_{10} \right \} \left \{ q_1,q_{01} \right \} \left \{ q_{11} \right \}$

Hence, We get Three distingushable states in the given DFA. 

So, Answer = $3$

answered by Boss (21.8k points)
0 votes

I think this should be minimised dfa

answered by Loyal (6.1k points)

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

47,139 questions
51,387 answers
66,699 users