Iterating iterated substitution

Share/Save/Bookmark

Engelfriet, Joost (1977) Iterating iterated substitution. Theoretical computer science, 5 (1). pp. 85-100. ISSN 0304-3975

open access
[img]
Preview
PDF
2MB
Abstract:By iterating iterated substitution not all regular languages can be copied. Hence the smallest full hyper (1)-AFL is properly contained in ETOL, the smallest full hyper-AFL. The number of iterations of iterated substitution gives rise to a proper hierarchy. Consequently the smallest full hyper (1)-AFL is not a full principal AFL.
Item Type:Article
Copyright:© 1977 Elsevier Science
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:http://purl.utwente.nl/publications/68024
Official URL:http://dx.doi.org/10.1016/0304-3975(77)90043-3
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page