MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Consider the ...

Question

Consider the following DFA;

The number of states in the minimal. DFA obtained by applying minimization algorithm is equal to______.

A

4

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

B

3

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

5

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

2

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is A 4
Partition - 1: {B, C} {A, D, E, F}
Partition - 2: {B, C} {A, D, E} {F}
Partition - 3: {B, C} {A, E} {D} {F}
Partition - 4: {B, C} {A, E} {D} {F}
Total 4 states.

Suggest Corrections

thumbs-up

0

Similar questions

Q. Consider the following

\in

Number of final states in minimal DFA is ______

Q. Consider the DFAs M and N given above. The number of states in a minimal DFA that accpets the language

L (M) \cap L (N)

L \subseteq {0, 1}^{*}

be an arbitrary regular language accepted by a minimal DFA with k states. Which one of the following languages must necessarily be accepted by a minimal DFA with k states?

Q. Consider the graph given below.

Use Kruskal's algorithm to find a minimal spanning tree for the graph. The list of the edges of the tree in the order in which they are chosen is

(3)
(1), (2), (3), (4)
(1) (2)
(1), (2), (3)

Q. Let N be an NFA with n states. Let k be the number of states of a minimal DFA which is equivalent to N. Which one of the following is necessairly true ?

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Marked price_tackle

Watch in App

Join BYJU'S Learning Program

CrossIcon