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

asked in Theory of Computation by (181 points)
retagged by | 26 views

2 Answers

0 votes

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 (13.2k points)
0 votes

I think this should be minimised dfa

answered by Junior (637 points)

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

36,157 questions
43,608 answers
42,860 users