Learning nominal automata

Joshua Moerman, Matteo Sammartino, Alexandra Silva, Bartek Klin, Michal Szynwelski

    Research output: Chapter in Book/Report/Conference proceedingConference Article in proceedingAcademicpeer-review


    We present an Angluin-style algorithm to learn nominal automata, which are acceptors of languages over infinite (structured) alphabets. The abstract approach we take allows us to seamlessly extend known variations of the algorithm to this new setting. In particular we can learn a subclass of nominal non-deterministic automata. An implementation using a recently developed Haskell library for nominal computation is provided for preliminary experiments.
    Original languageEnglish
    Title of host publicationPOPL 2017
    Subtitle of host publicationProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages
    EditorsGiuseppe Castagna, Andrew D. Gordon
    PublisherAssociation for Computing Machinery
    Number of pages13
    ISBN (Print) 978-1-4503-4660-3
    Publication statusPublished - 2017
    Event44th ACM SIGPLAN Symposium on Principles of Programming Languages - Paris, France
    Duration: 15 Jan 201721 Jan 2017
    Conference number: 44


    Symposium44th ACM SIGPLAN Symposium on Principles of Programming Languages
    Abbreviated titlePOPL '17
    Internet address


    Dive into the research topics of 'Learning nominal automata'. Together they form a unique fingerprint.

    Cite this