Scribd
Upload
357 views5 pages

Problem: Step 1

The document discusses converting two nondeterministic finite automata (NFAs) to equivalent deterministic finite automata (DFAs) using Theorem 1.39. It provides the step-by-step process for converting each NFA, which involves: 1) defining the states of the DFA as subsets of the NFA states, 2) calculating the transition function, 3) setting the start state, and 4) determining accepting states. Diagrams of the equivalent DFAs are given.

Uploaded by

Apinya SUTHISOPHAARPORN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
357 views5 pages

Problem: Step 1

The document discusses converting two nondeterministic finite automata (NFAs) to equivalent deterministic finite automata (DFAs) using Theorem 1.39. It provides the step-by-step process for converting each NFA, which involves: 1) defining the states of the DFA as subsets of the NFA states, 2) calculating the transition function, 3) setting the start state, and 4) determining accepting states. Diagrams of the equivalent DFAs are given.

Uploaded by

Apinya SUTHISOPHAARPORN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Problem

Use the construction given in Theorem 1.39 to convert the following two nondeterministic finite automata to equivalent deterministic finite automata.

THEOREM 1.39

Every nondeterministic finite automaton has an equivalent deterministic finite automaton.

Step-by-step solution

Step 1 of 2

a.

Consider the Non-deterministic Finite Automata,


By using Theorem 1.39, “For every non-deterministic finite automata, there is an equivalent Deterministic finite automation”.

Constructing equivalent DFA for the given NFA:

1. where is the subset of all sets of Q.

So,

2. For an element R in and a in set of alphabets , Calculate . Here, performs the


transition on r for some value of a.

3. where is the start state in NFA.

Here, ={1}.

4. . The machine M accepts the possible states where the NFA is present in the accept state.

5. The state diagram for the equivalent DFA is as follows:

Comments (2)

Step 2 of 2

b.

Consider the Non-deterministic Finite Automata,


By using Theorem 1.39, “For every non-deterministic finite automata, there is an equivalent Deterministic finite automation”.

Constructing equivalent DFA for the given NFA:

The initial state of DFA is 1 let x= (Qx, ∑, δx, q0, Fx ).

1. where is the subset of all sets of Q.

So,

2. Considering notations for each .

The collection of states reached from R by moving along the notations is,

3. Calculate . Here, performs the transition on r for some value of a.


4. Changing to the start state becomes,

5. The state diagram for the equivalent DFA is as follows:


Simplifying the machine by eliminating no arrow points. Here {1},{2},{1,3} and {3} do not contain any incoming arrows. Thus, the simplified machine
is:

Comments (7)

You might also like