On Succinct Description of Certain Context-Free Languages by Ins-Del and Matrix Ins-Del Systems.

In this paper, we introduce some basic measures for insertion-deletion system and matrix insertion-deletion system. These measures are based on the number of variables, the number of productions and the number of symbols in a grammar. We show that with respect to these measures, both the systems are more succinct over context-free grammars in representing certain families of context-free languages. [ABSTRACT FROM AUTHOR]