3 ms·
> In other words, when you have reasonably big practical finite problem with limited memory. FSA runs quickly out of memory. Yes this is a difference in the ex
by naasking 4y ago
> In other words, when you have reasonably big practical finite problem with limited memory. FSA runs quickly out of memory.
Yes this is a difference in the expressiveness of each model, because FSAs can require a combinatorial explosion in the number of states to model a Turing machine. The parent is still technically correct though.