Java: generating the design of a non-deterministic finite automaton (NFA)

Asked

Viewed 67 times

1

I am making a program that receives a text file with parameters of a nondeterministic automaton, from it rules are created for this automaton, with ifs where each state should go. However in the end I will have to assemble an automaton and print out the whole tree. How could I do this part from print? any idea what to look for?

1 answer

0


  • If you can go a little further in answering (even with a mock graph and the generated image) I would appreciate it very much.

Browser other questions tagged

You are not signed in. Login or sign up in order to post.