AbstractThis paper investigates the structure of derivations in deterministic ET0L systems. The main theorem says that in a deterministic ETOL system each derivation of a long enough word of a special kind (the so-called f-random word) has a rather strong combinatorial structure. In fact the main result of this paper is essential for proving some useful properties of ET0L languages which is demonstrated in a number of papers
In this paper we study systematically three basic classes of grammars incorporating parallel rewriti...
Deterministic substitution of languages means substituting the same word (from a given language) for...
The notion of an ETOL system with rank is defined. It extends naturally studied already notions of a...
This paper investigates the structure of derivations in deterministic ETOL systems. The main theorem...
AbstractA OL system is called a quasi-deterministic OL system or a D'OL system for short if there is...
This paper is concerned with deterministic ETOL languages. A theorem is proved which, roughly speaki...
AbstractThis paper provides a method of “decomposing” a subclass of ET0L languages into deterministi...
In this paper, we sharpen the results of Gaeartner on the universality of partition-limited ET0L sys...
It is shown that if G is a deterministic ETOL system, there is a nondeterministic log space algorit...
It is shown that if G is a deterministic ETOL system, there is a nondeterministic log space algorith...
This paper provides a method of ''decomposing'' a subclass of ETOL languages into deterministic ETO...
This paper provides a method of decomposing a subclass of ETOL languages into deterministic ETOL lan...
AbstractRestricted versions of DT0L systems, so-called commutative DT0L systems, are considered. In ...
AbstractThe class of ETOL systems is investigated from a structural point of view. The effect of sev...
It is shown that there exist context free languages which are not deterministic ETOL languages. The ...
In this paper we study systematically three basic classes of grammars incorporating parallel rewriti...
Deterministic substitution of languages means substituting the same word (from a given language) for...
The notion of an ETOL system with rank is defined. It extends naturally studied already notions of a...
This paper investigates the structure of derivations in deterministic ETOL systems. The main theorem...
AbstractA OL system is called a quasi-deterministic OL system or a D'OL system for short if there is...
This paper is concerned with deterministic ETOL languages. A theorem is proved which, roughly speaki...
AbstractThis paper provides a method of “decomposing” a subclass of ET0L languages into deterministi...
In this paper, we sharpen the results of Gaeartner on the universality of partition-limited ET0L sys...
It is shown that if G is a deterministic ETOL system, there is a nondeterministic log space algorit...
It is shown that if G is a deterministic ETOL system, there is a nondeterministic log space algorith...
This paper provides a method of ''decomposing'' a subclass of ETOL languages into deterministic ETO...
This paper provides a method of decomposing a subclass of ETOL languages into deterministic ETOL lan...
AbstractRestricted versions of DT0L systems, so-called commutative DT0L systems, are considered. In ...
AbstractThe class of ETOL systems is investigated from a structural point of view. The effect of sev...
It is shown that there exist context free languages which are not deterministic ETOL languages. The ...
In this paper we study systematically three basic classes of grammars incorporating parallel rewriti...
Deterministic substitution of languages means substituting the same word (from a given language) for...
The notion of an ETOL system with rank is defined. It extends naturally studied already notions of a...
DOI
Add to ORKG