Iterated Deterministic Substitution

Peter R.J. Asveld, Joost Engelfriet

    Research output: Book/ReportReportOther research output


    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
    Place of PublicationEnschede
    PublisherUniversity of Twente, Department of Applied Mathematics
    Number of pages27
    Publication statusPublished - 1976


    • HMI-SLT: Speech and Language Technology


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

    Cite this