Issue No. 03 - March (1974 vol. 23)
A. Paz , Department of System Science, University of California
The problem of approximating a linear automaton (LA) over the field of real numbers by an automaton over the field of rationals is considered. "Strong" and "weak" types of approximation are defined and investigated. Necessary and sufficient conditions for an automaton to be approximable are given. The strong approximation method enables rational computation in irrational linear systems which is suited for computer use.
Approximation, eigenvalue, linear automaton (LA), norm, spectral radius.
A. Paz and M. Rabinovitz, "Linear Automata Approximation Problem," in IEEE Transactions on Computers, vol. 23, no. , pp. 249-255, 1974.