Observations about bounded languages and developmental systems
We prove that every strictly bounded language with a semilinear Parikh mapping is an EDTOL language, and use the main proofargument to establish that all finite intersections of bounded context-free languages, and also the complements of these intersections, are EDTOL languages.