Contrary to a widely-held belief, it is possible to construct executable specifications of language processors that use a top-down parsing strategy and which have structures that directly reflect the structure of grammars containing left-recursive productions. A novel technique has been discovered by which the non-termination that would otherwise occur is avoided by ‘guarding’ top-down left-rec...

In the previous papers (Masreliez and Martin, 1977; Novovičova, 1987; Schick and Mitter, 1994) the problem of recursive estimation of linear dynamic systems parameters and of the state of such systems in the presence of outliers in observations have been considered. In this connection various ordinary recursive techniques are worked out, when systems output is corrupted by an additive noise wit...

In this work, a new technique based on Green’s function and the Adomian decomposition method (ADM) for solving nonlinear singular boundary value problems (SBVPs) is proposed. The technique relies on constructing Green’s function before establishing the recursive scheme for the solution components. In contrast to the existing recursive schemes based on the ADM, the proposed technique avoids solv...

We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises the traces of the computation of the function. The structure of a prophecy is a possibly infinite tree, which is coerced by linearisation to a type of partial results defined by applying the delay monad to the co-domai...

1. Let [qo, qi,q2, ■ • ■ J be a Kleene enumeration of partial recursive functions. If / is such a function, denote by 9f its index set, 9f= {ra|g„^/}. Insofar as the indices of a partial recursive function correspond to the different sets of "instructions" for computing its values, it is natural to ask how much of the "complexity" of the function is reflected by its index set; for example, one ...

This paper presents a new pel recursive motion compensated prediction algorithm for video coding applications. The derivation of the algorithm is based on Recursive Least Squares (RLS) estimation that minimizes the mean square prediction error for each pel (picture element). A comparison with the modified Steepest-descent gradient estimation algorithm shows significant improvement in terms of m...

The design of controller for nonlinear system in strict feedback form which the equilibrium point is origin focus study. Backstepping technique applied. Recursive used backstepping control technique. Using approach, we are given a reasonably simple method to law with these properties. closed-loop system’s global asymptotic stability attained by incorporating Lyapunov function; this case, quadra...

Kazemi (2014) introduced a new version of bucket recursive trees as another generalization of recursive trees where buckets have variable capacities. In this paper, we get the $p$-th factorial moments of the random variable $S_{n,1}$ which counts the number of subtrees size-1 profile (leaves) and show a phase change of this random variable. These can be obtained by solving a first order partial...

and key words In this paper, we consider the array processors implementation of the infinite impulse response (11R)1-D and 2-D digital filters that require recursive computations . We use the state space representation to obtain, in a straight forward manner, efficient implementation via dynamically switchable systolic arrays (cylindrical type) of 1 -D direct realisation . This direct descripti...

background: precise diagnosis of disease risk factors via efficient statistical models is the primary step for reducing the heavy costs of breast cancer, as one of the most highly prevalent cancer throughout the world. therefore, the aim of this study was to present a recently introduced statistical model in order to assess its proficiency for model fitting. methods: the information of 1465 eli...