@@ -0,0 +1,661 @@
+from automata.fa.nfa import NFA%0Afrom automata.fa.dfa import DFA%0A%0A%22%22%22 Test NFA-%3EDFA when initial state has epsilon transitions %22%22%22%0A%0A# NFA which matches strings beginning with 'a', ending with 'a', and containing%0A# no consecutive 'b's%0Anfa = NFA(%0A    states=%7B'q0', 'q1', 'q2'%7D,%0A    input_symbols=%7B'a', 'b'%7D,%0A    transitions=%7B%0A        'q0': %7B'': %7B'q2'%7D%7D,%0A        'q1': %7B'a': %7B'q1'%7D%7D,%0A        'q2': %7B'a': %7B'q1'%7D%7D%0A    %7D,%0A    initial_state='q0',%0A    final_states=%7B'q1'%7D%0A)%0A%0Aprint(%22NFA: %7B%7D%22.format(nfa.read_input('a')))%0A%0Adfa = DFA.from_nfa(nfa)  # returns an equivalent DFA%0Aprint(%22DFA: %22)%0Aprint(%22Initial State: %7B%7D%22.format(dfa.initial_state))%0Aprint(dfa.read_input('a') )%0A

add test for nfa2dfa_epsilon_start