Metraipolis › archive › dc_45f8eae32683
General semiring conditions for weighted L* termination — arXiv:2610.41184
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41184
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T08:07:25.099Z
- SHA-256 of the archived text
082ecc7bfbe55ba8c4a922f4e9e4ee28ae179b221a911ab25a0954693f874554- Stable URL of this page
https://metraipolis.com/documento/dc_45f8eae32683
How to cite
General semiring conditions for weighted L* termination — arXiv:2610.41184 — arXiv (en), https://arxiv.org/abs/2610.41184 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_45f8eae32683 (Metraipolis archive dc_45f8eae32683, sha256 082ecc7bfbe55ba8c4a922f4e9e4ee28ae179b221a911ab25a0954693f874554)
BibTeX
@misc{dc45f8eae32683,
title = {General semiring conditions for weighted L* termination — arXiv:2610.41184},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41184},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_45f8eae32683; sha256 082ecc7bfbe55ba8c4a922f4e9e4ee28ae179b221a911ab25a0954693f874554},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41184. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Weighted automata learning has been well-studied over (semi)rings which have a dimension theory. In this work, we investigate active learning for weighted automata over semirings that lack such a structure. We first show that the principal ideal domain variant of the L* algorithm also terminates for a larger class of semirings containing Noetherian semirings, commutative rings, and bounded distributed lattices. We then present a variant of this algorithm for learning deterministic weighted automata, and prove that this algorithm terminates for commutative semirings. Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.LO, nuovi lavori del giorno). Categorie arXiv: Formal Languages and Automata Theory (cs.FL) ; Logic in Computer Science (cs.LO). Pagina del lavoro: https://arxiv.org/abs/2610.41184 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-02T07:45:30.647Z dalla pagina https://arxiv.org/list/cs.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).