FiniteAutomata Converter (NFA to DFA)

This is a programming assignment for Compiler Design course.

IDE Used:

IntelliJ IDEA

Libraries Used:

• JGraphX

The program is required to convert a NFA to DFA using the following algorithm:

put  e-closure({s0}) as an unmarked  state into the set of DFA (DS)
while (there is one unmarked S1 in DS) do 
	begin
		  mark S1
		  for each input symbol a do 
		      begin
		          S2 <- e-closure(move(S1,a))
		          if (S2 is not in DS) then
			          add S2 into DS as an unmarked state
		          transfunc[S1,a] <- S2
		      end
	end

Screenshots:

Input

Output:

A demonstration video: