This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Linear Automata Approximation Problem
March 1974 (vol. 23 no. 3)
pp. 249-255
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.
Index Terms:
Approximation, eigenvalue, linear automaton (LA), norm, spectral radius.
Citation:
A. Paz, M. Rabinovitz, "Linear Automata Approximation Problem," IEEE Transactions on Computers, vol. 23, no. 3, pp. 249-255, March 1974, doi:10.1109/T-C.1974.223919
Usage of this product signifies your acceptance of the Terms of Use.