Representable Sets

F. Blanchet-Sadri       Sean Simmons

Abstract    Paper    Implementation

Let S be a set of words. We want to decide if there exists a word w so that subw(n)=S for some n. The applet below allows us to do this. It works as follows. Enter a word from S into the input box and then click "Add". Do this with each word in S one by one. The applet will then tell you if there exists a word w so that S=subw(n) for some n. Click "Clear" if you want to start again.

 

This page may not function correctly if you do not have the latest Java Runtime Environment and the latest Java Plugin.