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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Learning regular languages over infinite alphabets

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.

This talk is included in these lists:

  • This talk is not included in any other list

Note that ex-directory lists are not shown.

Other lists

Science SS03, William Gates Building. GS1 Donald McIntyre Building

Other talks

Feedback and the circumgalactic medium Together Now: Cooperation and Collaboration in Social Art Practice Ensemble inequivalence for systems with long-range interactions Title TBC title abstract tbc Advances in Label-Free High-Resolution Molecular Imaging using J Series III Cluster SIMS
 

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