Recently, people have started using dfa for tagging some finite-automata questions.
Do we really need this tag, or should it be a synonym for finite-automata?
The question can be asked in principle about nfa, but nobody used this so far. We do have nondeterminism.
I think finite-automata is specific enough, even for questions that aim towards getting a DFA. That is because determinism is (usually) not the issue; every NFA can be algorithmically converted into a DFA. The issue is finding any finite automaton.
For questions that specifically deal with nondeterminism, we already have nondeterminism (which can be used with any machine-model tag).
Therefore, I think dfa and nfa (proactively) are obsolete. I proposed them as synonyms of finite-automata; if you agree, please upvote them.
