Are the sets of all finite automata and pushdown automata countable?
-
04-11-2019 - |
题
So considering that set of all turing machines is countably infinite, can we also say that set of all FA machines(DFA/NFA) or set of all PDA machines(DPDA/NPDA) are countably infinite, Considering that we can build all of them with Turing machine?
没有正确的解决方案
不隶属于 cs.stackexchange