DocumentCode
1114863
Title
Linear Automata Approximation Problem
Author
Paz, Azaria ; Rabinovitz, Moshe
Author_Institution
Department of System Science, University of California
Issue
3
fYear
1974
fDate
3/1/1974 12:00:00 AM
Firstpage
249
Lastpage
255
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.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1974.223919
Filename
1672512
Link To Document