3 ms·
DFA is the absurdity, not NFA. Every non-deterministic finite state automaton can be converted into a deterministic finite state automaton that accepts the sam
by microtonal 5y ago
DFA is the absurdity, not NFA.
Every non-deterministic finite state automaton can be converted into a deterministic finite state automaton that accepts the same language (see powerset construction [1]), so I am not sure what you are saying here.
[1] https://en.wikipedia.org/wiki/Powerset_construction https://en.wikipedia.org/wiki/Powerset_construction
- rurban 5y agoyes, and this absurdity does not make it a better language. rather a worse. eg tons of simple recursively defined languages were converted to DFA monstrosities, and since then they became slower and unmaintainable.