| Class | Description |
|---|---|
| DFABenchmarks | |
| ExampleAngluin |
This class provides the example used in the paper ''Learning Regular Sets from Queries and Counterexamples'' by Dana
Angluin that consists of an automaton that accepts ''all strings over {0,1} with an even number of 0's and an even
number of 1's''.
|
| ExampleKeylock | |
| ExamplePaulAndMary |
This class implements a sad love story - DFA style.
|
| ExampleRandomDFA | |
| ExampleTinyDFA |
Tiny DFA with language (ab)*.
|
Copyright © 2019. All rights reserved.