On Learning Nominal Automata with Binders

09/12/2019
by   Yi Xiao, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

09/07/2017

Beyond ωBS-regular Languages: ωT-regular Expressions and Counter-Check Automata

In the last years, various extensions of ω-regular languages have been p...
06/13/2019

Two modes of recognition: algebra, coalgebra, and languages

The aim of the paper is to build a connection between two approaches tow...
06/01/2015

Learning Regular Languages over Large Ordered Alphabets

This work is concerned with regular languages defined over large alphabe...
11/03/2019

Automata Learning: An Algebraic Approach

We propose a generic categorical framework for learning unknown formal l...
07/10/2018

Streamable Regular Transductions

Motivated by real-time monitoring and data processing applications, we d...
07/07/2020

A Myhill-Nerode Theorem for Register Automata and Symbolic Trace Languages

We propose a new symbolic trace semantics for register automata (extende...
12/02/2020

Effective Feedback for Introductory CS Theory: A JFLAP Extension and Student Persistence

Computing theory analyzes abstract computational models to rigorously st...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.