RegAut. An algorithm that decide if a finite deterministic automaton accepts a set definable in FO[<,mod]

github.com/Arthur-Milchior/RegAut

@Arthur-Milchior

Problem

Audience

Updates

No founder updates yet. Check back soon.