the main purpose of this paper is to define a new regular matrix by using fibonacci numbers and to investigate its matrix domain in the classical sequence spaces $ell _{p},ell _{infty },c$ and $c_{0}$, where $1leq p

The main purpose of this paper is to define a new regular matrix by using Fibonacci numbers and to investigate its matrix domain in the classical sequence spaces $ell _{p},ell _{infty },c$ and $c_{0}$, where $1leq p

A four-dimensional matrix transformation is said to be regular if it maps every bounded-convergent double sequence into a convergent sequence with the same limit. Firstly, Robison [G.M. Robison, Divergent double sequences and series, Trans. Amer. Math. Soc. 28 (1926) 50–73] presented the necessary and sufficient conditions for regular matrix transformations of double sequences. In this paper, t...

Functional MSO transductions, deterministic two-way transducers, as well streaming string transducers are all equivalent models for regular functions. In this paper, we show that every function, either on finite words or infinite words, captured by a transducer, can be described with transducer expression (RTE ). For the uses Muller acceptance and ω-regular look-ahead. RTEs constructed from con...

During a recent conversation, R . P. Agnew suggested a determination of the validity of the proposition that row-infinite Toeplitz transformations are more powerful than row-finite transformations . Before this proposition is examined, it is necessary to assign a precise meaning to it. Corresponding to every sequence s a regular rowfinite Toeplitz transformation A can be constructed such that t...

We consider the factorization problem of regular hedge languages. This problem is strongly related to the type checking problem in rule based transformations of valid XML documents. We propose the representation of regular hedge languages by reduced, complete, and deterministic linear hedge automata, and indicate algorithms for the computation of right factors and factor matrix.

let a; b; k 2 k and u ; v 2 u(k). we show for any idempotent e 2 k, ( a 0 b 0 ) is e-clean i ( a 0 u(vb + ka) 0 ) is e-clean and if ( a 0 b 0 ) is 0-clean, ( ua 0 u(vb + ka) 0 ) is too.