Question: 1 . For an alphabet = { 0 , 1 } let L be a language of strings that contain the substring 0 1 1

1. For an alphabet ={0,1} let L be a language of strings that contain the substring 0110.
List 3 strings that are in the language.
List 3 strings that are NOT in the language
Is the empty string in the language?
Draw a finite state diagram that accepts the language. Test your diagrams with your 2. For an alphabet ={0,1}, let L be the language of strings that do NOT contain the substring 0110.
List 3 strings that are in the language.
List 3 strings that are NOT in the language
Is the empty string in the language?
Draw a finite state diagram that a ccepts the language. Test your diagrams with your strings from parts a, b, and c 3. For an alphabet ={0,1}, let L be the language of strings that contain an EVEN number of 1s.
List 3 strings that are in the language.
List 3 strings that are NOT in the language
Is the empty string in the language?
Draw a finite state diagram that accepts the language. Test your diagrams with your strings from parts a, b, and c.

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 Programming Questions!