Learning Weighted Automata over Principal Ideal Domains

6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we study active learning algorithms for weighted automata over a semiring. We show that a variant of Angluin’s seminal L* algorithm works when the semiring is a principal ideal domain, but not for general semirings such as the natural numbers.

Cite

CITATION STYLE

APA

van Heerdt, G., Kupke, C., Rot, J., & Silva, A. (2020). Learning Weighted Automata over Principal Ideal Domains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12077 LNCS, pp. 602–621). Springer. https://doi.org/10.1007/978-3-030-45231-5_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free