Inferring Symbolic Automata
We study the learnability of symbolic finite state automata (SFA), a model shown useful in many applications in software verification. The state-of-the-art literature on this topic follows the query learning paradigm, and so far all obtained results are positive. We provide a necessary condition for...
I tiakina i:
| Ngā kaituhi matua: | , , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Logical Methods in Computer Science e.V.
2023-04-01
|
| Rangatū: | Logical Methods in Computer Science |
| Ngā marau: | |
| Urunga tuihono: | https://lmcs.episciences.org/8899/pdf |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|