On Controlled Iterated GSM Mappings and Related Operations

P.R.J. Asveld

    Research output: Book/ReportReportOther research output


    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 languageEnglish
    Place of PublicationAmsterdam
    PublisherStichting Mathematisch Centrum
    Number of pages11
    Publication statusPublished - 1979


    • Generalized sequential machine
    • HMI-SLT: Speech and Language Technology
    • Tabled Lindenmayer system
    • Controlled rewriting

    Cite this