Abstract
In [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
Original language | Undefined |
---|---|
Pages (from-to) | 139-145 |
Number of pages | 7 |
Journal | Revue Roumaine de Mathematiques Pures et Appliquees |
Volume | XXV |
Publication status | Published - 1980 |
Keywords
- MSC-68Q42
- MSC-68Q45
- EWI-3648
- HMI-SLT: Speech and Language Technology