Add to ORKGDeterministic substitution of languages means substituting the same word (from a given language) for all occurrences of a symbol. For an arbitrary family $K$ of languages the notion of deterministic $K$-iteration grammar is introduced, which is essentially the iteration of a finite number of deterministic substitutions of languages from $K$. The families of languages generated by these grammars are investigated
The rewrite relation with parameters m and n and with the possible length limit = k or :::; k we den...
We consider generative mechanisms producing languages by starting from a finite set of words and shu...
AbstractA word w is said to be repeatable with respect to a substitution if it is a descendant of w ...
AbstractTwo iteration theorems, one for strict deterministic languages of degree n, the other for si...
The notion of a K-iteration grammar, where K is a family of languages, provides a uniform framework ...
the date of receipt and acceptance should be inserted later Abstract A special kind of substitution ...
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
Extended macro grammars (of the linear basic type only) are introduced as a generalization of those ...
Many different deletion operations are investigated applied to languages ac-cepted by one-way and tw...
In [17] G. Paun studied families of languages generated by iterated gsm mappings, iterated finite su...
A procedure to resolve simple deterministic languages into the concatenation of other simple determi...
AbstractAn infinite hierarchy of deterministic context free languages is introduced. The hierarchy i...
A certain category of infinite strings of letters on a finite alphabet is presented here, chosen amo...
An iterative array is a line of interconnected interacting finite automata. One distinguished automa...
The rewrite relation with parameters m and n and with the possible length limit = k or :::; k we den...
We consider generative mechanisms producing languages by starting from a finite set of words and shu...
AbstractA word w is said to be repeatable with respect to a substitution if it is a descendant of w ...
AbstractTwo iteration theorems, one for strict deterministic languages of degree n, the other for si...
The notion of a K-iteration grammar, where K is a family of languages, provides a uniform framework ...
the date of receipt and acceptance should be inserted later Abstract A special kind of substitution ...
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
Extended macro grammars (of the linear basic type only) are introduced as a generalization of those ...
Many different deletion operations are investigated applied to languages ac-cepted by one-way and tw...
In [17] G. Paun studied families of languages generated by iterated gsm mappings, iterated finite su...
A procedure to resolve simple deterministic languages into the concatenation of other simple determi...
AbstractAn infinite hierarchy of deterministic context free languages is introduced. The hierarchy i...
A certain category of infinite strings of letters on a finite alphabet is presented here, chosen amo...
An iterative array is a line of interconnected interacting finite automata. One distinguished automa...
The rewrite relation with parameters m and n and with the possible length limit = k or :::; k we den...
We consider generative mechanisms producing languages by starting from a finite set of words and shu...
AbstractA word w is said to be repeatable with respect to a substitution if it is a descendant of w ...