3 ms·
every non deterministic SM can be converted into FSM: "Using the subset construction algorithm, each NFA can be translated to an equivalent DFA" https://en.wiki
by slt2021 6y ago
every non deterministic SM can be converted into FSM:
"Using the subset construction algorithm, each NFA can be translated to an equivalent DFA"
https://en.wikipedia.org/wiki/Nondeterministic_finite_automaton https://en.wikipedia.org/wiki/Nondeterministic_finite_automa...
- gopiandcode 6y agoHow is that relevant to the parent's point? Non-determinism has no relation to a system with infinite states, and the NFSM -> FSM construction algorithm provides no help in that case.