Learning nominal automata

DOI10.1145/3009837.3009879zbMath1380.68243arXiv1607.06268OpenAlexW3099647739WikidataQ60507068 ScholiaQ60507068MaRDI QIDQ5370894

Alexandra Silva, Joshua Moerman, Matteo Sammartino, Bartek Klin, Michał Szynwelski

Publication date: 20 October 2017

Published in: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.06268

zbMATH Keywords

functional programmingactive learningnominal automata(non)deterministic finite automata

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18)

Related Items

Completeness of Nominal PROPs, Learning infinite-word automata with loop-index queries, Completeness and incompleteness in nominal Kleene algebra, Active learning for deterministic bottom-up nominal tree automata, A (co)algebraic theory of succinct automata, On-the-fly bisimilarity checking for fresh-register automata, Unnamed Item, Learning weighted automata over principal ideal domains, Unnamed Item, Polynomial-time equivalence testing for deterministic fresh-register automata, Learning Symbolic Automata, Unnamed Item, Fast computations on ordered nominal sets, A Myhill-Nerode theorem for register automata and symbolic trace languages, A novel learning algorithm for Büchi automata based on family of DFAs and classification trees, A categorical framework for learning generalised tree automata

Uses Software

• Haskell
• z3
• LOIS
• Sigma*
• NLambda