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...
محفوظ في:
| المؤلفون الرئيسيون: | , , , , |
|---|---|
| التنسيق: | 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 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|