Learning weighted automata over principal ideal domains

Gerco van Heerdt, Clemens Kupke, Jurriaan Rot, Alexandra Silva

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

6 Citations (Scopus)
74 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationFoundations of Software Science and Computation Structures
Subtitle of host publication23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020, Proceedings
EditorsJean Goubault-Larrecq, Barbara König
Place of PublicationCham, Switzerland
PublisherSpringer
Pages602-621
Number of pages20
ISBN (Electronic)978-3-030-45231-5
ISBN (Print)978-3-030-45230-8
DOIs
Publication statusPublished - 17 Apr 2020
Event23rd International Conference, Foundations of Software Science and Computation Structures 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. - Dublin, Ireland
Duration: 25 Apr 202030 Apr 2020
https://etaps.org/2020/fossacs

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume12077

Conference

Conference23rd International Conference, Foundations of Software Science and Computation Structures 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020.
Abbreviated titleFOSSACS
Country/TerritoryIreland
CityDublin
Period25/04/2030/04/20
Internet address

Keywords

  • weighted automata
  • automata learning

Fingerprint

Dive into the research topics of 'Learning weighted automata over principal ideal domains'. Together they form a unique fingerprint.

Cite this