Arthur-Milchior/RegAut
An algorithm that decide if a finite deterministic automaton accepts a set definable in FO[<,mod]
Tool to help transcribing comic by fans
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
An algorithm that decide if a finite deterministic automaton accepts a set definable in FO[<,mod]
Git Community Book Source - Version Francaise (voir branche "french")