Add to ORKGIn [17] G. Paun studied families of languages generated by iterated gsm mappings, iterated finite substitutions, and iterated homomorphisms. In this note we generalize some results in [17], and we discuss the relation between iterated finite substitutions (homomorphisms) and (deterministic) tabled context-independent Lindenmayer systems. --------- [17] G. Paun, On the iteration of GSM mappings, Rev. Roum. Math. Pures et Appl. XXIII (1978) 921-93
We improve several upper bounds to the complexity of the membership problem for languages defined by...
The stable string operation selects from the strings produced by a rewriting system those strings wh...
This paper investigates the boundedness and convergence properties of two general iterative processe...
In [17] G. Paun studied families of languages generated by iterated gsm mappings, iterated finite su...
The notion of a K-iteration grammar, where K is a family of languages, provides a uniform framework ...
Deterministic substitution of languages means substituting the same word (from a given language) for...
The notion of an iterated Γ map, that is, a nondeterministic generalized sequential machine with acc...
AbstractLindenmayer systems are a class of parallel rewriting systems originally introduced to model...
This paper considers equality languages and fixed-point languages of homomorphisms and deterministic...
the date of receipt and acceptance should be inserted later Abstract A special kind of substitution ...
AbstractIterated finite state sequential transducers are considered as language generating devices. ...
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
This Paper deals with relations between substitutions and parallel rewriting in the sense of Linden...
The introduction of syntax directed translations and transformations into formallanguage theory pres...
We improve several upper bounds to the complexity of the membership problem for languages defined by...
The stable string operation selects from the strings produced by a rewriting system those strings wh...
This paper investigates the boundedness and convergence properties of two general iterative processe...
In [17] G. Paun studied families of languages generated by iterated gsm mappings, iterated finite su...
The notion of a K-iteration grammar, where K is a family of languages, provides a uniform framework ...
Deterministic substitution of languages means substituting the same word (from a given language) for...
The notion of an iterated Γ map, that is, a nondeterministic generalized sequential machine with acc...
AbstractLindenmayer systems are a class of parallel rewriting systems originally introduced to model...
This paper considers equality languages and fixed-point languages of homomorphisms and deterministic...
the date of receipt and acceptance should be inserted later Abstract A special kind of substitution ...
AbstractIterated finite state sequential transducers are considered as language generating devices. ...
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
This Paper deals with relations between substitutions and parallel rewriting in the sense of Linden...
The introduction of syntax directed translations and transformations into formallanguage theory pres...
We improve several upper bounds to the complexity of the membership problem for languages defined by...
The stable string operation selects from the strings produced by a rewriting system those strings wh...
This paper investigates the boundedness and convergence properties of two general iterative processe...