Question: L 1 = { w | w does not contain the string tr } L 2 = { w | w does contain the string

L1={w|w does not contain the string tr}
L2={w|w does contain the string tr}
Given language over {t, r}, the difference of the minimum number of states required to form L1 and L2?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!