Modifier and Type | Class and Description |
---|---|
class |
DTLearnerDFA<I>
Algorithm for learning DFA using the Discrimination Tree algorithm.
|
Modifier and Type | Class and Description |
---|---|
class |
KearnsVaziraniDFA<I>
The Kearns/Vazirani algorithm for learning DFA, as described in the book "An Introduction to Computational Learning
Theory" by Michael Kearns and Umesh Vazirani.
|
Modifier and Type | Class and Description |
---|---|
class |
ClassicLStarDFA<I>
Implementation of the L* algorithm by Dana Angluin.
|
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 |
MalerPnueliDFA<I> |
Modifier and Type | Method and Description |
---|---|
LearningAlgorithm.DFALearner<I> |
NLStarLearner.asDFALearner()
Retrieves a view of this learner as a DFA learner.
|
Modifier and Type | Class and Description |
---|---|
class |
RivestSchapireDFA<I> |
Modifier and Type | Class and Description |
---|---|
class |
PrefixTTTLearnerDFA<I> |
class |
TTTLearnerDFA<I> |
Modifier and Type | Interface and Description |
---|---|
static interface |
OTLearner.OTLearnerDFA<I> |
Modifier and Type | Class and Description |
---|---|
class |
NFALearnerWrapper<I> |
Copyright © 2018. All rights reserved.