Finite-Data Algorithms for Approximate Stochastic Realization

1986 ◽  
pp. 105-122 ◽  
Author(s):  
Richard J. Vaccaro
Keyword(s):  
Stochastic Realization ◽  
Finite Data

Verified numerical computations for an inverse elliptic eigenvalue problem with finite data

2001 ◽  
Vol 18 (2) ◽  
pp. 587-602 ◽  
Author(s):  
Mitsuhiro T. Nakao ◽  
Yoshitaka Watanabe ◽  
Nobito Yamamoto
Keyword(s):  
Eigenvalue Problem ◽  
Numerical Computations ◽  
Elliptic Eigenvalue Problem ◽  
Finite Data

The Equational Specification of Finite Minimal Unoids Using only Unary Hidden Functions

1982 ◽  
Vol 5 (2) ◽  
pp. 143-170
Author(s):  
Jan A. Bergstra ◽  
John-Jules Ch. Meyer
Keyword(s):  
Data Type ◽  
Bounded Number ◽  
Special Case ◽  
Finite Data

In [5] it has been proved that by using hidden functions the number of equations needed to specify a finite data type is bounded by numbers depending only on the signature of that data type. In the special case of a finite minimal unoid, however, it seems to be relevant to ask whether or not a specification can also be made by a bounded number of equations using only unary hidden functions. In this paper we prove that this can be done.

Sign in / Sign up

Export Citation Format

Share Document