Review of Automaton Learning Algorithms with Polynomial Complexity -- Completely Solved Examples
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916210171445248 |
|---|---|
| author | Haneef, Farah |
| author_facet | Haneef, Farah |
| contents | Automaton learning is a domain in which the target system is inferred by the automaton learning algorithm in the form of an automaton, by synthesizing a finite number of inputs and their corresponding outputs. Automaton learning makes use of a Minimally Adequate Teacher (MAT). The learner learns the target system by posing membership queries to the MAT. In this chapter, I have provided completely solved examples of automaton learning algorithms. According to the best of my knowledge these are not available in any other source. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_11096 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Review of Automaton Learning Algorithms with Polynomial Complexity -- Completely Solved Examples Haneef, Farah Formal Languages and Automata Theory Computational Complexity Automaton learning is a domain in which the target system is inferred by the automaton learning algorithm in the form of an automaton, by synthesizing a finite number of inputs and their corresponding outputs. Automaton learning makes use of a Minimally Adequate Teacher (MAT). The learner learns the target system by posing membership queries to the MAT. In this chapter, I have provided completely solved examples of automaton learning algorithms. According to the best of my knowledge these are not available in any other source. |
| title | Review of Automaton Learning Algorithms with Polynomial Complexity -- Completely Solved Examples |
| topic | Formal Languages and Automata Theory Computational Complexity |
| url | https://arxiv.org/abs/2404.11096 |