Regular Omega Language Learning (ROLL)

User Tools

Site Tools

Trace:
play

Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
play [2018/11/13 16:01] – liyongplay [2018/11/14 13:50] (current) – liyong
Line 64: Line 64:
 {{:a1.png?200|}} {{:a1.png?200|}}
  
-In this case, you can answer a counterexample, say (b, ab) since the output automaton is clearly not the right conjecture.+The above output automaton is clearly not the right conjecture. 
 +In this case, you can answer a counterexample, say b(ab)<sup>ω</sup> given by its decomposition (b, ab), which is accepted by the conjecture but is not in the target language, to the learner.
 <code> <code>
 0 0
Line 126: Line 127:
 {{:a2.png?200|}} {{:a2.png?200|}}
  
-Above automaton is the right conjecture accepting the language {a,b}<sup>*</sup>b<sup></sup>.+Above automaton is the right conjecture accepting the language {a,b}<sup>*</sup>b<sup>ω</sup>.
 Thus we can reply with a positive answer to the learner, which means that the learner has completed the learning task. Thus we can reply with a positive answer to the learner, which means that the learner has completed the learning task.
 <code> <code>
Line 137: Line 138:
 java -jar ROLL.jar play -periodic -v 2 java -jar ROLL.jar play -periodic -v 2
 </code> </code>
-Besides the output conjectures, ROLL also outputs the intermediate FDFAs it learned and their corresponding observation tables.+Besides the output conjectures, ROLL also allows the user to see how the FDFA and its corresponding observation tables evolve during the learning procedure. 
 +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 of an execution of above command is given as follows.
 <code> <code>
 PLAYING,TABLE,PERIODIC,NONE,NBA,UNDER,verbose=2,bs=false,dot=false,inputfile=null,outputfile=null,outputA=null,outputB=null PLAYING,TABLE,PERIODIC,NONE,NBA,UNDER,verbose=2,bs=false,dot=false,inputfile=null,outputfile=null,outputA=null,outputB=null
  
-2018/11/13 15:45:10 [ info] ROLL for interactive play...+2018/11/13 16:11:13 [ info] ROLL for interactive play...
 Please input the number of letters ('a'-'z'):  Please input the number of letters ('a'-'z'): 
 2 2
Line 210: Line 212:
 ab ab
 You input a loop: ab You input a loop: ab
 +Current FDFA:
 //FFA-M:  //FFA-M: 
 digraph { digraph {
Line 234: 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 258: Line 262:
 } }
  
-Not in target: b$ab +Counterexample not in target: b$ab 
-final counterexample b$ab+final counterexample for the FDFA learner: b$ab
 normalized factorization: (b, ab) normalized factorization: (b, ab)
 Is w-word (ϵ, ab) in the unknown languge: 1/0 Is w-word (ϵ, ab) in the unknown languge: 1/0
play.1542096100.txt.gz · Last modified: 2018/11/13 16:01 by liyong