### Abstract

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 language | English |
---|---|

Place of Publication | Enschede |

Publisher | University of Twente, Department of Applied Mathematics |

Number of pages | 27 |

Publication status | Published - 1976 |

### Keywords

- HMI-SLT: Speech and Language Technology

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

## Cite this

Asveld, P. R. J., & Engelfriet, J. (1976).

*Iterated Deterministic Substitution*. Enschede: University of Twente, Department of Applied Mathematics.