Minimal Partial Languages and ◊-DFAs
Francine Blanchet-Sadri, Kira Goldner, and Aidan Shackleton

Implementation


Enter the ◊-substitution concatenated together followed by the full language, with the ◊-substitution and each word separated by a comma and a space. Then click compute to see the minimal partial language for that full language! Holes in words are represented by ^.

For example: σ(◊) = {a, b}, L = {aaa, aab, aba} would be entered as "ab, aaa, aab, aba" where the alphabet is concatenated together as the first entry.

This applet may not work properly if you do not have the latest Java Runtime Environment and the latest Java Plugin.