University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Learning regular languages over infinite alphabets

Learning regular languages over infinite alphabets

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Dominic Mulligan.

This talk has been canceled/deleted

We present an Angluin-style algorithm to learn nominal automata, which are acceptors of languages over infinite (structured) alphabets. We discuss several optimizations to the naive algorithm and provide an implementation using a recently developed Haskell library for nominal computation.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.

 

© 2006-2022 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity