Finite Automatons and images
At a lecture about regular expressions and automatons, we were introduced to the posibility of using automatons to compress images. During the course we have worked with a java package for automatons, so i made a quick hack to render regexps as images.
The concept is that every acepting state represents black area, and and using a recursive definition of the areas.
Here is the area for the string “031”
