Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914284311674880 |
|---|---|
| author | Löding, Christof Walukiewicz, Igor |
| author_facet | Löding, Christof Walukiewicz, Igor |
| contents | Abu Radi and Kupferman (2019) demonstrated the efficient minimization of history-deterministic (transition-based) co-Büchi automata, building on the results of Kuperberg and Skrzypczak (2015). We give a congruence-based description of these minimal automata, and a self-contained proof of its correctness. We use this description based on congruences to create a passive learning algorithm that can learn minimal history-deterministic co-Büchi automata from a set of labeled example words. The algorithm runs in polynomial time on a given set of examples, and there is a characteristic set of examples of polynomial size for each minimal history-deterministic co-Büchi automaton. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_14304 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning Löding, Christof Walukiewicz, Igor Formal Languages and Automata Theory F.4.3 Abu Radi and Kupferman (2019) demonstrated the efficient minimization of history-deterministic (transition-based) co-Büchi automata, building on the results of Kuperberg and Skrzypczak (2015). We give a congruence-based description of these minimal automata, and a self-contained proof of its correctness. We use this description based on congruences to create a passive learning algorithm that can learn minimal history-deterministic co-Büchi automata from a set of labeled example words. The algorithm runs in polynomial time on a given set of examples, and there is a characteristic set of examples of polynomial size for each minimal history-deterministic co-Büchi automaton. |
| title | Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning |
| topic | Formal Languages and Automata Theory F.4.3 |
| url | https://arxiv.org/abs/2505.14304 |