License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2021.15
URN: urn:nbn:de:0030-drops-134498
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/13449/
Go to the corresponding LIPIcs Volume Portal


Colcombet, Thomas ; Petrişan, Daniela ; Stabile, Riccardo

Learning Automata and Transducers: A Categorical Approach

pdf-format:
LIPIcs-CSL-2021-15.pdf (0.6 MB)


Abstract

In this paper, we present a categorical approach to learning automata over words, in the sense of the L*-algorithm of Angluin. This yields a new generic L*-like algorithm which can be instantiated for learning deterministic automata, automata weighted over fields, as well as subsequential transducers. The generic nature of our algorithm is obtained by adopting an approach in which automata are simply functors from a particular category representing words to a "computation category". We establish that the sufficient properties for yielding the existence of minimal automata (that were disclosed in a previous paper), in combination with some additional hypotheses relative to termination, ensure the correctness of our generic algorithm.

BibTeX - Entry

@InProceedings{colcombet_et_al:LIPIcs:2021:13449,
  author =	{Thomas Colcombet and Daniela Petrişan and Riccardo Stabile},
  title =	{{Learning Automata and Transducers: A Categorical Approach}},
  booktitle =	{29th EACSL Annual Conference on Computer Science Logic (CSL 2021)},
  pages =	{15:1--15:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-175-7},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{183},
  editor =	{Christel Baier and Jean Goubault-Larrecq},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/13449},
  URN =		{urn:nbn:de:0030-drops-134498},
  doi =		{10.4230/LIPIcs.CSL.2021.15},
  annote =	{Keywords: Automata, transducer, learning, category}
}

Keywords: Automata, transducer, learning, category
Collection: 29th EACSL Annual Conference on Computer Science Logic (CSL 2021)
Issue Date: 2021
Date of publication: 13.01.2021


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI