Learning nominal automata
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 36169010
- Type
- E - Conference contribution
- DOI
-
10.1145/3009837.3009879
- Title of conference / published proceedings
- POPL 2017 : Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages
- First page
- 613
- Volume
- -
- Issue
- -
- ISSN
- 0730-8566
- Open access status
- Out of scope for open access requirements
- Month of publication
- January
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
4
- Research group(s)
-
-
- Citation count
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Presents the first active learning algorithm for nominal automata, a rich class of automata over infinite alphabets. It also provides a version of the algorithm capable of learning non-deterministic -- hence more succinct -- models. This is a major advance in the state-of-the-art, as other active learning approaches for infinite-state models can only learn deterministic models. Accepted at POPL '17, acceptance rate ~23%. It resulted in an invited talk in the RiSE seminar cycle (https://arise.or.at/seminar/), an international cycle organised by Austrian research institutions. This work led to the EPSRC grant EP/S028641/1 and the VeTSS grant 4207703/RFA 15845.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -