We have explored the question of Deterministic vs. Non-Deterministic Automata and the difference it makes or doesn't make in terms of computational power (that is to say, the size of the classes of languages recognized by such automata). When we think about it, deterministic automata are models of sequential processing while non-deterministic automata are models of parallel processing.

Can it be said that, for any processing tool, parallel processing can always be reduced to sequential processing, independently of any efficiency considerations?

Briefly justify your answer.