java - A Simulator for a non-deterministic Push-Down Automaton -
Well, I need to create simulators for non-deterministic push-down automatons. Everything is OK, I know that I need recursion or something similar but I do not know how to create a function that will simulate for swapping.
I got everything in control, automaton generator, stack ... I am doing this in Java, so it is hardly the issue that men can bump, and I did it. So if someone has done something like that, then I can use the advice.
This is my current code code:
category: class transit: list & lt; Transit & gt; -contains non deterministic transition state input signal pile signal class generator generated NPA public boolean generated automaton from file clas () - this function i am having trouble with from the different problem with the pile problem And input for every branch
I tried to solve it with the collection of object NPA and tried to start every object, but it does not work.
OK, think about the definition of swap. You have state and state transition function. You have a heap
However, it is a theorem (see) that each ethical finite otoman has the equivalent determinant FSA.
One way you can make equivalent DFA. It is the most vulnerable position in the worst case scenario, however: each state in the DFA map for a subset of the powers of NFA states.
So you can try "line" instead. Now, instead of building equivalent DFA, you simulate NFA; On state changes, you build all the other states that reach you and keep them on some data structure; Then go back and see what happens next to each such situation.
Comments
Post a Comment