Residuality and Learning for Nondeterministic Nominal Automata

We are motivated by the following question: which data languages admit an active learning algorithm? This question was left open in previous work by the authors, and is particularly challenging for languages recognised by nondeterministic automata. To answer it, we develop the theory of residual nom...

Full description

Bibliographic Details
Main Authors: Joshua Moerman, Matteo Sammartino
Format: Article
Language:English
Published: Logical Methods in Computer Science e.V. 2022-02-01
Series:Logical Methods in Computer Science
Subjects:
Online Access:https://lmcs.episciences.org/7332/pdf