As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
This article investigates languages generated by insertion-deletion systems of small size. Four classes of asymmetrical insertion-deletion systems are considered; two of them are known to be computationally uncomplete. We show a series of proper inclusions that permit to determine some non-trivial lower bounds for the corresponding languages.