Multiple (simple) context-free tree grammars are investigated, where “simple” means “linear and nondeleting”. Every multiple context-free tree grammar that is finitely ambiguous can be lexicalized; i.e., it can be transformed into an equivalent one (generating the same tree language) in which each rule of the grammar contains a lexical symbol. Due to this transformation, the rank of the nonterm...

In this paper, a new method is proposed in order to evaluate the stochastic solution of linear random differential equation. The method is based on the combination of the probabilistic transformation method for a single random variable and the numerical methods (e.g. finite difference, finite element, Runge-Kutta, etc...). The transformation technique evaluates the probability density function ...

The realization of a discrete-time, linear, time-invariant (LTI) filter from its impulse response provides insight into the role of linear algebra in the analysis of both dynamical systems and rational functions. For an LTI filter, a sequence of output data measured over some finite period of time may be expressed as the linear combination of the past input and the input measured over that same...

This paper presents en algorithm for solving interval linear programming problems. The algorithm is a finite iterative method, which in each iteration solves a full row rank interval linear progranming problem, with only one additional constraint. The solution and/or problem chosen appears to be conputationally more efficient than that in the Ben-Israel and Robers algorithm.

In commutative algebra, a Weitzenböck derivation is a nonzero triangular linear derivation of the polynomial algebra K[x1, . . . , xm] in several variables over a field K of characteristic 0. The classical theorem of Weitzenböck states that the algebra of constants is finitely generated. (This algebra coincides with the algebra of invariants of a single unipotent transformation.) In this paper ...

This paper presents a novel adaptive reduced-rank multi-input multi-output (MIMO) equalization scheme and algorithms based on alternating optimization design techniques for MIMO spatial multiplexing systems. The proposed reduced-rank equalization structure consists of a joint iterative optimization of two equalization stages, namely, a transformation matrix that performs dimensionality reductio...

In this paper we investigate partial spreads of H(2n− 1, q2) through the related notion of partial spread sets of hermitian matrices, and the more general notion of constant rank-distance sets. We prove a tight upper bound on the maximum size of a linear constant rank-distance set of hermitian matrices over finite fields, and as a consequence prove the maximality of extensions of symplectic sem...

Abstract: In this paper we investigate observability of small solutions of linear differential-algebraic systems with delays (DAD), i.e. solutions that vanish after some finite time. In particular, we prove existence of two kinds of small solutions of DAD systems. The main result are the rank type conditions for observability of three kinds of small solutions of linear differential-algebraic sy...