Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Part A - Automata Construction 1.Draw a DFA which accepts the following language over the alphabet of {0,1}: the set of all strings which contain

Part A - Automata Construction

1.Draw a DFA which accepts the following language over the alphabet of {0,1}: the set of all strings which contain a block of four consecutive symbols exactly two of which are 0. Your DFA must handle all intput strings in {0,1}*. Here is a methodical way to do this:

Figure out all the final states and label each with the shortest string it accepts,

work backwards from these states to the starting state, labelling each state you create with the shortest string accepted so far,

add the missing transitions.

The labelling of the states with the shortest string it accepts is important in order to not get confused.

2.Draw a DFA which accepts the following language over the alphabet of {0,1}: the set of all strings such that each any block of four consecutive symbols does not have exactly two 1's. Your DFA must handle all intput strings in {0,1}*. (Hint: look at solution of previous question) Note: "each" has been changed to "any" because people were finding "each" ambiguous.

3.Draw the simplest possible (i.e. with fewest number of states) NFA which accepts the following language over the alphabet of {a, e, i, o, u, b, p, r, s, t}: the set of strings which start with a consonant, then one or more vowels, then a consonant, and after reading any sequence of 0 or more symbols from the alphabet, eventually ends with the same vowel that preceded the second consonant.

4.Assuming that you have the following three automata, A1, A2, A3 recognizing the languages L1, L2, L3 respectively, shown here as black boxes:

image text in transcribedimage text in transcribedimage text in transcribed

a. Draw an NFA called A which recognizes the language L2 L1 (L1* | L3)

b. What is the starting state of A?

c. What are A's final states?

S1 F1 S1 F1

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Graph Databases In Action

Authors: Dave Bechberger, Josh Perryman

1st Edition

1617296376, 978-1617296376

More Books

Students also viewed these Databases questions