|
|
|
|
|
|
by tjgq
4963 days ago
|
|
|
Interestingly, any physical, finite machine can be modelled as a finite state automaton (which is even more limited than a pushdown automaton) with a large enough state space. The distinction only comes up when you consider idealized infinite machines. Theory of computation is weird. |
|
|