An efficient algorithm for learning event-recording automata
In inference of untimed regular languages, given an unknown language to be inferred, an automaton is constructed to accept the unknown language from answers to a set of membership queries each of which asks whether a string is contained in the unknown language. One of the most well-known regular inf...
Saved in:
| Main Authors: | , , , , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Institutional Knowledge at Singapore Management University
2011
|
| 主題: | |
| 在線閱讀: | https://ink.library.smu.edu.sg/sis_research/5026 https://ink.library.smu.edu.sg/context/sis_research/article/6029/viewcontent/An_Efficient_Algorithm_for_Learning_Event_Recording_Automata.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|