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-937
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
The introduction of syntax directed translations and transformations into formallanguage theory pres...
AbstractIn modern theories of rewriting structures, hyper-sentential and hyper-algebraic extensions ...
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 ...
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...
Deterministic substitution of languages means substituting the same word (from a given language) for...
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. ...
This Paper deals with relations between substitutions and parallel rewriting in the sense of Linden...
The stable string operation selects from the strings produced by a rewriting system those strings wh...
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
We improve several upper bounds to the complexity of the membership problem for languages defined by...
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
The introduction of syntax directed translations and transformations into formallanguage theory pres...
AbstractIn modern theories of rewriting structures, hyper-sentential and hyper-algebraic extensions ...
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 ...
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...
Deterministic substitution of languages means substituting the same word (from a given language) for...
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. ...
This Paper deals with relations between substitutions and parallel rewriting in the sense of Linden...
The stable string operation selects from the strings produced by a rewriting system those strings wh...
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
We improve several upper bounds to the complexity of the membership problem for languages defined by...
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
The introduction of syntax directed translations and transformations into formallanguage theory pres...
AbstractIn modern theories of rewriting structures, hyper-sentential and hyper-algebraic extensions ...