play
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| play [2018/11/13 15:50] – liyong | play [2018/11/14 13:50] (current) – liyong | ||
|---|---|---|---|
| Line 32: | Line 32: | ||
| 1 | 1 | ||
| </ | </ | ||
| - | When the learner constructs a conjectured NBA, it will ask an equivalence query for the conjecture. | + | When the learner constructs a conjectured NBA, it will ask an equivalence query for the following |
| - | In this case, you can answer a counterexample, | + | |
| < | < | ||
| Resolving equivalence query for hypothesis (# | Resolving equivalence query for hypothesis (# | ||
| Line 58: | Line 57: | ||
| 4 -> 0 [label="" | 4 -> 0 [label="" | ||
| } | } | ||
| + | |||
| + | </ | ||
| + | You can get the following graphical view of above dot text on the webpage [[http:// | ||
| + | |||
| + | |||
| + | {{: | ||
| + | |||
| + | The above output automaton is clearly not the right conjecture. | ||
| + | In this case, you can answer a counterexample, | ||
| + | < | ||
| 0 | 0 | ||
| Now you have to input a counterexample for inequivalence. | Now you have to input a counterexample for inequivalence. | ||
| Line 67: | Line 76: | ||
| You input a loop: ab | You input a loop: ab | ||
| </ | </ | ||
| - | |||
| - | {{: | ||
| The learner will ask several membership queries in order to analyze the received counterexample and to construct a new conjecture. | The learner will ask several membership queries in order to analyze the received counterexample and to construct a new conjecture. | ||
| Line 97: | Line 104: | ||
| 0 | 0 | ||
| </ | </ | ||
| - | This time we receive the right conjectured NBA and reply with positive answer to the learner, which means that the learner has completed its learning task. | + | This time we receive the following |
| < | < | ||
| Resolving equivalence query for hypothesis (# | Resolving equivalence query for hypothesis (# | ||
| Line 116: | Line 123: | ||
| } | } | ||
| + | </ | ||
| + | |||
| + | {{: | ||
| + | |||
| + | Above automaton is the right conjecture accepting the language {a, | ||
| + | Thus we can reply with a positive answer to the learner, which means that the learner has completed the learning task. | ||
| + | < | ||
| 1 | 1 | ||
| Congratulations! Learning completed... | Congratulations! Learning completed... | ||
| </ | </ | ||
| - | Following command allows the user to see more details about the storage of the membership queries when using the table-based L< | + | Following command allows the user to see more details about the learning procedure. |
| < | < | ||
| java -jar ROLL.jar play -periodic -v 2 | java -jar ROLL.jar play -periodic -v 2 | ||
| </ | </ | ||
| - | + | Besides the output conjectures, | |
| - | + | Moreover, the log also shows the counterexample analysis information as described in paper [6]. | |
| - | The complete log information is given as follows. | + | |
| + | The complete log information | ||
| < | < | ||
| PLAYING, | PLAYING, | ||
| - | 2018/ | + | 2018/ |
| Please input the number of letters (' | Please input the number of letters (' | ||
| 2 | 2 | ||
| Line 197: | Line 212: | ||
| ab | ab | ||
| You input a loop: ab | You input a loop: ab | ||
| + | Current FDFA: | ||
| // | // | ||
| digraph { | digraph { | ||
| Line 221: | Line 237: | ||
| Is w-word (b, ab) in the unknown languge: 1/0 | Is w-word (b, ab) in the unknown languge: 1/0 | ||
| 0 | 0 | ||
| + | DFA D_{u$v} for counterexample (u, v): | ||
| digraph Automaton { | digraph Automaton { | ||
| rankdir = LR; | rankdir = LR; | ||
| Line 245: | Line 262: | ||
| } | } | ||
| - | Not in target: b$ab | + | Counterexample not in target: b$ab |
| - | final counterexample b$ab | + | final counterexample |
| normalized factorization: | normalized factorization: | ||
| Is w-word (ϵ, ab) in the unknown languge: 1/0 | Is w-word (ϵ, ab) in the unknown languge: 1/0 | ||
play.1542095435.txt.gz · Last modified: 2018/11/13 15:50 by liyong