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.CONCUR.2020.44
URN: urn:nbn:de:0030-drops-128563
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/12856/
Go to the corresponding LIPIcs Volume Portal

Moerman, Joshua ; Sammartino, Matteo

Residual Nominal Automata

pdf-format:
LIPIcs-CONCUR-2020-44.pdf (0.6 MB)

Abstract

We are motivated by the following question: which nominal languages admit an active learning algorithm? This question was left open in previous work, and is particularly challenging for languages recognised by nondeterministic automata. To answer it, we develop the theory of residual nominal automata, a subclass of nondeterministic nominal automata. We prove that this class has canonical representatives, which can always be constructed via a finite number of observations. This property enables active learning algorithms, and makes up for the fact that residuality - a semantic property - is undecidable for nominal automata. Our construction for canonical residual automata is based on a machine-independent characterisation of residual languages, for which we develop new results in nominal lattice theory. Studying residuality in the context of nominal languages is a step towards a better understanding of learnability of automata with some sort of nondeterminism.

BibTeX - Entry

@InProceedings{moerman_et_al:LIPIcs:2020:12856,
  author =	{Joshua Moerman and Matteo Sammartino},
  title =	{{Residual Nominal Automata}},
  booktitle =	{31st International Conference on Concurrency Theory (CONCUR 2020)},
  pages =	{44:1--44:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-160-3},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{171},
  editor =	{Igor Konnov and Laura Kov{\'a}cs},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12856},
  URN =		{urn:nbn:de:0030-drops-128563},
  doi =		{10.4230/LIPIcs.CONCUR.2020.44},
  annote =	{Keywords: nominal automata, residual automata, derivative language, decidability, closure, exact learning, lattice theory}
}

Keywords: nominal automata, residual automata, derivative language, decidability, closure, exact learning, lattice theory
Collection: 31st International Conference on Concurrency Theory (CONCUR 2020)
Issue Date: 2020
Date of publication: 26.08.2020

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