Differences

This shows you the differences between two versions of the page.

--- start [2018/11/16 15:13] – liyong
+++ start [2019/01/08 11:07] – [Active Automata Learning Background Knowledge] liyong
@@ Line 26: / Line 26: @@
   * Learning algorithm for limit-deterministic Büchi automata.
   * [[https://iscasmc.ios.ac.cn/roll/jupyter|Jupyter notebook for ROLL]] (requires **websockets** to run correctly).
-  * Interactive mode for education purpose.
+  * Interactive mode for educational purpose.
   * Büchi automata complementation based on learning [7].
   * Büchi automata inclusion testing based on word sampling and learning.
@@ Line 36: / Line 36: @@
 ===== Active Automata Learning Background Knowledge =====
-In the active automata learning setting proposed by Angluin [1], there are a //teacher//, which knows the target language //L//, and a //learner//, whose task is to learn from the teacher the target language, represented by an automaton.
+In the active automata learning setting proposed by Angluin [1], there is a //teacher//, who knows the target language //L//, and a //learner//, whose task is to learn from the teacher the target language, represented by an automaton.
 The learner interacts with the teacher by means of two kinds of queries: //membership queries// and //equivalence 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//.