pathterminuspages/projects/aboutcontactabout me

NFA to DFA convert - Version 1.1

Nfa2Dfa #5 :: 13-05-2018

Contents
 -NFA to DFA convert - Preface
 -NFA to DFA convert - Syntax/Input
 -NFA to DFA convert - Convertion
 -NFA to DFA convert - The Application
 @NFA to DFA convert - Version 1.1

Version 1.1

The following has been added

  • Comments can inserted with # as prefix. The comment ends with newline ex. # I'm a comment.
  • I have made it a choice whether the application should terminate when a cycle is discovered. It happens to be so that some NFA's that can be converted, contains cycles.
  • I'm more and more convinced that the intended behavior of such a converter is to allow infinite loops in epsilon closures. Thus now the algorithm adds to e-closure by fixpoint: If an element do not exist in the new closure, add it and the ε-closure of that element. Otherwise skip and examine the next element.

The following are on the TODO-list

  • Remove the circular error handling.
  • Maybe use HashSet instead of lists when calculating closure paths.
CommentsGuest Name:Comment: