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.
Original language | Undefined |
---|---|
Pages (from-to) | 85-100 |
Journal | Theoretical computer science |
Volume | 5 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1977 |
Keywords
- IR-68024