Iterated Deterministic Substitution

Peter R.J. Asveld, Joost Engelfriet

    Research output: Contribution to journalArticleAcademicpeer-review

    10 Citations (Scopus)
    73 Downloads (Pure)


    Deterministic 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.
    Original languageEnglish
    Pages (from-to)285-302
    Number of pages18
    JournalActa informatica
    Issue number3
    Publication statusPublished - 1977


    • MSC-68A30
    • HMI-SLT: Speech and Language Technology
    • Information systems
    • Operating systems
    • Data structure
    • Communication networks
    • Information theory


    Dive into the research topics of 'Iterated Deterministic Substitution'. Together they form a unique fingerprint.

    Cite this