Assignment #1: Automata and Computation (B3CS/E)

1# Convert the given Finite automaton into its Deterministic.

2# Define epsilon closure ? Find epsilon closures fo all the states of given NFA_. Using the Direct Method to construct the DFA.

3# Conclude what type of strings will be accepted by the below Finite automata (Drive the regular expressions).

4# Construct a NDFA with epsilon equivalent to

RE = 10 + (0 + 11)0*1.

Dr. Mohammed Fadle.. 22\2\2012