simulate Nondeterministic Finite State Automata (NFA) with λ-transition.
Budget: $30 – $250 USD
Problem:
The objective of this project is to simulate Nondeterministic Finite State Automata (NFA) with λ-transition. The inputs to the simulation are:
1. The alphabet
2. Number of states in NFA
3. Start state(s)
4. Final state(s)
5. Transition function (from_state, symbol, to_state)
For simplicity the states are numbered 1, 2, 3, .... You may also use # in place of λ in the transition function.
The next input is the string that the NFA will work on. During the simulation as you process each symbol from the string, print the symbol and the set of state(s) you end up at. Once the entire string is processed, print the message "Input Accepted" or "Input Rejected".
The objective of this project is to simulate Nondeterministic Finite State Automata (NFA) with λ-transition. The inputs to the simulation are:
1. The alphabet
2. Number of states in NFA
3. Start state(s)
4. Final state(s)
5. Transition function (from_state, symbol, to_state)
For simplicity the states are numbered 1, 2, 3, .... You may also use # in place of λ in the transition function.
The next input is the string that the NFA will work on. During the simulation as you process each symbol from the string, print the symbol and the set of state(s) you end up at. Once the entire string is processed, print the message "Input Accepted" or "Input Rejected".