A homomorphic representation of simple matrix languages

A Homomorphic Representation of Simple Matrix Languages

In this paper we continue the investigation of simple matrix languages introduced by Ibarra (1970) as a subfamily of matrix languages. Simple matrix languages have many properties similar to those of context-free languages. In the following, we prove that every simple matrix language can be written as a homomorphic image of the intersection of the Dyck context-free language and an equal matrix ...

Simple Matrix Languages

It is shown that £t(1)[~(l)] coincides with the class of context-free languages [regular sets] and that ~9' is a proper subset of the family of languages accepted by deterministic linear bounded automata, It is proved that ~(n)[~(n)] forms a hierarchy of classes of languages in ~9°[~]. The closure properties and decision problems associated with ,9°(n), ,.9", ,~(n), and ~ are thoroughly investi...

Efficient Learning of Some Linear Simple Matrix Languages

Matrix representation of a sixth order Sturm-Liouville problem and related inverse problem with finite spectrum

‎In this paper‎, ‎we find matrix representation of a class of sixth order Sturm-Liouville problem (SLP) with separated‎, ‎self-adjoint boundary conditions and we show that such SLP have finite spectrum‎. ‎Also for a given matrix eigenvalue problem $HX=lambda VX$‎, ‎where $H$ is a block tridiagonal matrix and $V$ is a block diagonal matrix‎, ‎we find a sixth order boundary value problem of Atkin...

On Subword Complexities of Homomorphic Images of Languages

— The subword complexity of a language K is the function nK on positive integer s such that nK (n) equals the number of different subwords of length n appearing in words of X. We investigate the relationship between nk(K) and nK where Kis a language and h is a homorphism. This study is aiso carried out for the special case when Kis a DOL language. Resumé. — La complexité des facteurs d'un langa...