Iterated deterministic substitution

Share/Save/Bookmark

Asveld, Peter R.J. and Engelfriet, Joost (1977) Iterated deterministic substitution. Acta Informatica, 8 (3). pp. 285-302. ISSN 0001-5903

open access
[img]
Preview
PDF
1MB
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.
Item Type:Article
Copyright:© 1977 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/65593
Official URL:http://dx.doi.org/10.1007/BF00264471
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page