Big data has always been an issue where, there is a limited storage space specially.

So compression of
data is needed to address this problem. We have discussed the image and text encryption using finite
automata and. For image encryption of black and white images and coloured images, several algorithms
have been discussed like inference algorithm, fractal based image compression using iterative function
systems including quad tree partitioning scheme and binary partitioning scheme. Since images can be
encoded to general or weighted finite automata using iterative function systems, we try to compress the
graph similar to finite automate. Another method is using the self-similarities between image and its
subsections using quad tree partitioning and then forming the quad tree and binary tree partitioning
approach we encode an image to Finite automata. Lastly we compare both approaches and deduce that
binary partitioning scheme is better than the quad tree partitioning scheme.