## Coding approaches to fault tolerance in linear dynamic systems

- Christoforos N. Hadjicostis, George C. Verghese
- IEEE Transactions on Information Theory
- 2005

@article{Zeigler1973EveryDI, title={Every Discrete Input Machine is Linearly Simulatable}, author={Bernard P. Zeigler}, journal={J. Comput. Syst. Sci.}, year={1973}, volume={7}, pages={161-167} }

- Published 1973 in J. Comput. Syst. Sci.
DOI:10.1016/S0022-0000(73)80041-8

This paper extends the work of Herman (1971) to show that all discrete input sequential machines (whether finite or infinite state) are linearly simulatable over fields of infinite characteristic. Since this permits the computation of nonrecursive functions, it is concluded that allowing nonlinear output decoding with infinite state linear machines leads to a triviality (as opposed to the case of finite state linear machines where it does not).