论文信息 - Linear Automata Approximation Problem

Linear Automata Approximation Problem

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.

Azaria Paz | Moshe Rabinovitz | A. Paz | Moshe Rabinovitz

[1] Michael A. Harrison,et al. Lectures on linear sequential machines , 1969 .

[2] Gabor T. Herman,et al. Computability Over Arbitrary Fields , 1970 .

[3] Alston S. Householder,et al. The Theory of Matrices in Numerical Analysis , 1964 .

[4] Jim Gray,et al. Infinite Linear Sequential Machines , 1968, J. Comput. Syst. Sci..

[5] W. Rudin. Principles of mathematical analysis , 1964 .

[6] Oliver Aberth,et al. The Concect of Effective Method Applied to Computational Problems of Linear Algebra , 1971, J. Comput. Syst. Sci..

[7] Gabor T. Herman,et al. Computability over arbitrary fields , 1969, STOC '69.

[8] Norms and the spectral radius of matrices , 1962 .

[9] Arthur Gill,et al. Linear sequential circuits , 1966 .

[10] Alston S. Householder,et al. Minimal matrix norms , 1959 .

[11] Peter Lancaster,et al. The theory of matrices , 1969 .

[12] V. Pták,et al. Norms, spectra and combinatorial properties of matrices , 1960 .

[13] Oliver Aberth,et al. Analysis in the Computable Number Field. , 1975 .

[14] M. Rabin. Computable algebra, general theory and theory of computable fields. , 1960 .