On Learning Nominal Automata with Binders

TL;DR

This paper introduces a generalized learning algorithm for nominal automata with binders, extending classical automata learning to handle alphabets with names, and analyzes its correctness and complexity.

Contribution

It presents a novel learning algorithm for nominal automata with binders, generalizing Angluin's L* algorithm to this new formalism.

Findings

Algorithm correctly learns nominal automata with binders

Theoretical complexity bounds are established

The approach captures nominal regular languages with binders

Abstract

We investigate a learning algorithm in the context of nominal automata, an extension of classical automata to alphabets featuring names. This class of automata captures nominal regular languages; analogously to the classical language theory, nominal automata have been shown to characterise nominal regular expressions with binders. These formalisms are amenable to abstract modelling resource-aware computations. We propose a learning algorithm on nominal regular languages with binders. Our algorithm generalises Angluin's L* algorithm with respect to nominal regular languages with binders. We show the correctness and study the theoretical complexity of our algorithm.