In this paper we given a homomorphic representation of simple matrix languages similar in form to those of context-free languages, namely: Any simple matrix language L can be written as the homomorphic image of the intersection of the Dyck context-free language and an equal matrix language. We do not obtain a characterization, because the converse is not true
AbstractWe consider decision problems of the following type. Given a language L and two homomorphism...
Simple matrix languages and right-linear simple matrix languages are defined as subfamilies of matri...
AbstractIn this note, we show that for context-sensitive languages there exists no characterization ...
AbstractIt is demonstrated that every context-free language is a homomorphic image of the intersecti...
AbstractIn this note, we show that for context-sensitive languages there exists no characterization ...
AbstractWe give a homomorphic characterization of the class of recursively enumerable languages: it ...
Let L be any class of languages, L\u27 be a class of languages which is closed under λ-free homomorp...
AbstractWe investigate various language families which can be obtained from sentential form language...
It is shown that every type 1 language can be generated by an ε-free simple matrix grammar (of order...
The context-free matrix grammar and the state grammar without any restriction in applying production...
AbstractIn this note we refine the Chomsky and Stanley's homomorphic characterization of context-fre...
http://deepblue.lib.umich.edu/bitstream/2027.42/5078/5/ajc8116.0001.001.pdfhttp://deepblue.lib.umich...
Let L be any class of languages, L\u27 be one of the classes of context-free, context-sensitive and ...
AbstractIn this paper the operations of homomorphic equality and inverse homomorphic equality are in...
AbstractIn this paper we propose a Chomsky-Schützenberger type characterization of k-poly-slender co...
AbstractWe consider decision problems of the following type. Given a language L and two homomorphism...
Simple matrix languages and right-linear simple matrix languages are defined as subfamilies of matri...
AbstractIn this note, we show that for context-sensitive languages there exists no characterization ...
AbstractIt is demonstrated that every context-free language is a homomorphic image of the intersecti...
AbstractIn this note, we show that for context-sensitive languages there exists no characterization ...
AbstractWe give a homomorphic characterization of the class of recursively enumerable languages: it ...
Let L be any class of languages, L\u27 be a class of languages which is closed under λ-free homomorp...
AbstractWe investigate various language families which can be obtained from sentential form language...
It is shown that every type 1 language can be generated by an ε-free simple matrix grammar (of order...
The context-free matrix grammar and the state grammar without any restriction in applying production...
AbstractIn this note we refine the Chomsky and Stanley's homomorphic characterization of context-fre...
http://deepblue.lib.umich.edu/bitstream/2027.42/5078/5/ajc8116.0001.001.pdfhttp://deepblue.lib.umich...
Let L be any class of languages, L\u27 be one of the classes of context-free, context-sensitive and ...
AbstractIn this paper the operations of homomorphic equality and inverse homomorphic equality are in...
AbstractIn this paper we propose a Chomsky-Schützenberger type characterization of k-poly-slender co...
AbstractWe consider decision problems of the following type. Given a language L and two homomorphism...
Simple matrix languages and right-linear simple matrix languages are defined as subfamilies of matri...
AbstractIn this note, we show that for context-sensitive languages there exists no characterization ...
DOI
Add to ORKG