|
Automata(nfa and dfa)
Hey you intelligent people;
I will appreciate it very much if anyone send me a program wrote by java applets which do this:
It receives a dfa transition functions and number of states from the user and then convert it into an equivalent nfa and show its graph to the userm
Help me I have a honework and the deadline is 24/12/2008
Thanks a lot:):)
|