| Modifier and Type | Class and Description |
|---|---|
class |
ExtensibleLStarDFA<I>
An implementation of Angluin's L* algorithm for learning DFAs, as described in the paper
"Learning Regular Sets from Queries and Counterexamples".
|
| Modifier and Type | Class and Description |
|---|---|
class |
ClassicLStarMealy<I,O>
An implementation of the L*Mealy algorithm for inferring Mealy machines, as described
by Oliver Niese in his Ph.D. thesis.
|
class |
ExtensibleLStarMealy<I,O> |
| Modifier and Type | Class and Description |
|---|---|
class |
MahlerPnueliDFA<I> |
class |
MahlerPnueliMealy<I,O> |
| Modifier and Type | Class and Description |
|---|---|
class |
RivestSchapireDFA<I> |
class |
RivestSchapireMealy<I,O> |
Copyright © 2014. All Rights Reserved.