Explain transition table in finite autometa
Answers
Answered by
1
i hpe help you
In automata theory and sequential logic, a state transition table is a table showing what state (or states in the case of a nondeterministic finite automaton) a finitesemiautomaton or finite state machine will move to, based on the current state and other inputs.
In automata theory and sequential logic, a state transition table is a table showing what state (or states in the case of a nondeterministic finite automaton) a finitesemiautomaton or finite state machine will move to, based on the current state and other inputs.
Similar questions