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 |
---|---|
Pages (from-to) | 285-302 |
Number of pages | 18 |
Journal | Acta informatica |
Volume | 8 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1977 |
Keywords
- MSC-68A30
- HMI-SLT: Speech and Language Technology
- Information systems
- Operating systems
- Data structure
- Communication networks
- Information theory