Title :
Linear Automata Approximation Problem
Author :
Paz, Azaria ; Rabinovitz, Moshe
Author_Institution :
Department of System Science, University of California
fDate :
3/1/1974 12:00:00 AM
Abstract :
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.
Keywords :
Approximation, eigenvalue, linear automaton (LA), norm, spectral radius.; Approximation methods; Automata; Computer science; Eigenvalues and eigenfunctions; Electronics industry; Linear approximation; Linear systems; Samarium; Sufficient conditions; Writing; Approximation, eigenvalue, linear automaton (LA), norm, spectral radius.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/T-C.1974.223919
