start
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionNext revisionBoth sides next revision | ||
start [2018/11/16 15:12] – liyong | start [2019/01/08 11:07] – [Active Automata Learning Background Knowledge] liyong | ||
---|---|---|---|
Line 25: | Line 25: | ||
Compared to its previous version, it now supports new features such as: | Compared to its previous version, it now supports new features such as: | ||
* Learning algorithm for limit-deterministic Büchi automata. | * Learning algorithm for limit-deterministic Büchi automata. | ||
- | * [[https:// | + | * [[https:// |
- | * Interactive mode for education | + | * Interactive mode for educational |
* Büchi automata complementation based on learning [7]. | * Büchi automata complementation based on learning [7]. | ||
* Büchi automata inclusion testing based on word sampling and learning. | * Büchi automata inclusion testing based on word sampling and learning. | ||
Line 36: | Line 36: | ||
===== Active Automata Learning Background Knowledge ===== | ===== Active Automata Learning Background Knowledge ===== | ||
- | In the active automata learning setting proposed by Angluin [1], there are a // | + | In the active automata learning setting proposed by Angluin [1], there is a // |
The learner interacts with the teacher by means of two kinds of queries: // | The learner interacts with the teacher by means of two kinds of queries: // | ||
A membership query //MQ[w]// asks whether a string //w// belongs to //L// while an equivalence query //EQ[A]// asks whether the hypothesis automaton //A// recognizes //L//. | A membership query //MQ[w]// asks whether a string //w// belongs to //L// while an equivalence query //EQ[A]// asks whether the hypothesis automaton //A// recognizes //L//. |
start.txt · Last modified: 2020/12/16 15:03 by liyong