AbstractIt is demonstrated that every context-free language is a homomorphic image of the intersection of two DOS languages and that every recursively enumerable language is the homomorphic image of the intersection of three DOS languages. It is also proved that by increasing the number of components in the intersections of DOS languages one gets an infinite hierarchy of classes of languages within the class of context-sensitive languages
A DOS system is like a DOL system except that at each derivation step the underlying homomorphism is...
Let L be any class of languages, L\u27 be one of the classes of context-free, context-sensitive and ...
AbstractWe investigate various language families which can be obtained from sentential form language...
AbstractWe give a homomorphic characterization of the class of recursively enumerable languages: it ...
In this paper we given a homomorphic representation of simple matrix languages similar in form to th...
AbstractIn this note, we show that for context-sensitive languages there exists no characterization ...
http://deepblue.lib.umich.edu/bitstream/2027.42/5078/5/ajc8116.0001.001.pdfhttp://deepblue.lib.umich...
International audienceWe study a family of context-free languages that reduce to $\eps$ in the free ...
International audienceWe study a family of context-free languages that reduce to $\eps$ in the free ...
International audienceWe study a family of context-free languages that reduce to $\eps$ in the free ...
It is shown that a language is recursively enumerable if and only if it is a homomorphic image of a ...
AbstractIt is undecidable whether or not a given context-free language and a propagating DT0L langua...
AbstractIt is proved that for any alphabet Σ there exist a homomorphism h, a deterministic minimal l...
A method of encoding the computation histories of a wide class of machines is introduced and used to...
Parallel context-free languages are generated by context-free grammars in which every occurrence of ...
A DOS system is like a DOL system except that at each derivation step the underlying homomorphism is...
Let L be any class of languages, L\u27 be one of the classes of context-free, context-sensitive and ...
AbstractWe investigate various language families which can be obtained from sentential form language...
AbstractWe give a homomorphic characterization of the class of recursively enumerable languages: it ...
In this paper we given a homomorphic representation of simple matrix languages similar in form to th...
AbstractIn this note, we show that for context-sensitive languages there exists no characterization ...
http://deepblue.lib.umich.edu/bitstream/2027.42/5078/5/ajc8116.0001.001.pdfhttp://deepblue.lib.umich...
International audienceWe study a family of context-free languages that reduce to $\eps$ in the free ...
International audienceWe study a family of context-free languages that reduce to $\eps$ in the free ...
International audienceWe study a family of context-free languages that reduce to $\eps$ in the free ...
It is shown that a language is recursively enumerable if and only if it is a homomorphic image of a ...
AbstractIt is undecidable whether or not a given context-free language and a propagating DT0L langua...
AbstractIt is proved that for any alphabet Σ there exist a homomorphism h, a deterministic minimal l...
A method of encoding the computation histories of a wide class of machines is introduced and used to...
Parallel context-free languages are generated by context-free grammars in which every occurrence of ...
A DOS system is like a DOL system except that at each derivation step the underlying homomorphism is...
Let L be any class of languages, L\u27 be one of the classes of context-free, context-sensitive and ...
AbstractWe investigate various language families which can be obtained from sentential form language...
DOI
Add to ORKG