Abstract
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.
- Fides Aarts and Frits W. Vaandrager. Learning I/O automata. In CONCUR, pages 71–85, 2010. Google Scholar
Digital Library
- Fides Aarts, Paul Fiterau-Brostean, Harco Kuppens, and Frits W. Vaandrager. Learning register automata with fresh value generation. In ICTAC, pages 165–183, 2015. Google Scholar
Digital Library
- Dana Angluin. Learning regular sets from queries and counterexamples. Inf. Comput., 75(2):87–106, 1987. Google Scholar
Digital Library
- Dana Angluin and Mikl´os Csürös. Learning markov chains with variable memory length from noisy output. In COLT, pages 298–308, 1997. Google Scholar
Digital Library
- Therese Berg, Bengt Jonsson, and Harald Raffelt. Regular inference for state machines with parameters. In FASE, pages 107–121, 2006. Google Scholar
Digital Library
- Google Scholar
Digital Library
- Therese Berg, Bengt Jonsson, and Harald Raffelt. Regular inference for state machines using domains with equality tests. In FASE, pages 317–331, 2008. Google Scholar
Digital Library
- Mikołaj Boja´nczyk and Sławomir Lasota. A machine-independent characterization of timed languages. In ICALP, pages 92–103, 2012. Google Scholar
Digital Library
- Google Scholar
- Mikołaj Boja´nczyk, Laurent Braud, Bartek Klin, and Sławomir Lasota. Towards nominal computation. In POPL, pages 401–412, 2012. Google Scholar
- Mikołaj Boja´nczyk, Bartek Klin, and Slawomir Lasota. Automata theory in nominal sets. LMCS, 10(3), 2014.Google Scholar
Digital Library
- Benedikt Bollig, Peter Habermehl, Carsten Kern, and Martin Leucker. Angluin-style learning of nfa. Technical Report LSV-08-28, ENS de Cachan, 2008.Google Scholar
Cross Ref
- Benedikt Bollig, Peter Habermehl, Carsten Kern, and Martin Leucker. Angluin-style learning of NFA. In IJCAI, pages 1004–1009, 2009. Google Scholar
Digital Library
- Benedikt Bollig, Peter Habermehl, Martin Leucker, and Benjamin Monmege. A fresh approach to learning register automata. In DLT, pages 118–130, 2013.Google Scholar
Digital Library
- Filippo Bonchi and Damien Pous. Hacking nondeterminism with induction and coinduction. Commun. ACM, 58(2):87–95, 2015. Google Scholar
Digital Library
- Matko Botincan and Domagoj Babic. Sigma*: symbolic learning of input-output specifications. In POPL, pages 443–456, 2013. Google Scholar
Digital Library
- Sofia Cassel, Falk Howar, Bengt Jonsson, and Bernhard Steffen. Active learning for extended finite state machines. Formal Asp. Comput., 28 (2):233–263, 2016. Google Scholar
Digital Library
- Vincenzo Ciancia and Ugo Montanari. Symmetries, local names and dynamic (de)-allocation of names. Inf. Comput., 208(12):1349–1367, 2010. Google Scholar
- Loris D’Antoni and Margus Veanes. Minimization of symbolic automata. In POPL, pages 541–554, 2014. Google Scholar
Digital Library
- 2535849.Google Scholar
Digital Library
- Stéphane Demri and Ranko Lazic. LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log., 10(3), 2009. Google Scholar
Digital Library
- Franc¸ois Denis, Aurélien Lemay, and Alain Terlutte. Residual finite state automata. Fundam. Inform., 51(4):339–368, 2002. Google Scholar
Digital Library
- Falk Howar, Bernhard Steffen, and Maik Merten. Automata learning with automated alphabet abstraction refinement. In VMCAI, pages 263–277, 2011. 19 Google Scholar
- Falk Howar, Bernhard Steffen, Bengt Jonsson, and Sofia Cassel. Inferring canonical register automata. In VMCAI, pages 251–266, 2012. Google Scholar
Cross Ref
- 17Google Scholar
- Malte Isberner, Falk Howar, and Bernhard Steffen. Inferring automata with state-local alphabet abstractions. In NFM, pages 124–138, 2013.Google Scholar
Digital Library
- 9Google Scholar
- Malte Isberner, Falk Howar, and Bernhard Steffen. Learning register automata: from languages to program structures. Machine Learning, 96(1-2):65–98, 2014. Google Scholar
Digital Library
- Bart Jacobs and Alexandra Silva. Automata learning: A categorical perspective. In Horizons of the Mind, pages 384–406, 2014, 20.Google Scholar
Cross Ref
- Michael Kaminski and Nissim Francez. Finite-memory automata. Theor. Comput. Sci., 134(2):329–363, 1994. Google Scholar
- Bartek Klin and Michał Szynwelski. SMT solving for functional programming over infinite structures. In MFSP, volume 207, pages 57–75, 2016.Google Scholar
Digital Library
- Eryk Kopczy´nski and Szymon Toru´nczyk. LOIS: an application of SMT solvers. In SMT, volume 1617, pages 51–60, 2016.Google Scholar
Digital Library
- Eryk Kopczy´nski and Szymon Toru´nczyk. LOIS: syntax and semantics. In POPL, 2017. This volume. Google Scholar
- Dexter Kozen, Konstantinos Mamouras, Daniela Petrisan, and Alexandra Silva. Nominal kleene coalgebra. In ICALP, pages 286–298, 2015. Google Scholar
Cross Ref
- 23Google Scholar
Digital Library
- Oded Maler and Irini-Eleftheria Mens. Learning regular languages over large alphabets. In TACAS, pages 485–499, 2014, 41.Google Scholar
- Oded Maler and Amir Pnueli. On the learnability of infinitary regular sets. Inf. Comput., 118(2):316–326, 1995. Google Scholar
- 1070.Google Scholar
Digital Library
- Irini-Eleftheria Mens and Oded Maler. Learning regular languages over large ordered alphabets. LMCS, 11(3), 2015.Google Scholar
Digital Library
- Ugo Montanari and Matteo Sammartino. A network-conscious πcalculus and its coalgebraic semantics. Theor. Comput. Sci., 546:188– 224, 2014. Google Scholar
- Leonardo De Moura and Nikolaj Bjørner. Z3: An efficient smt solver. In TACAS, pages 337–340, 2008. Google Scholar
Digital Library
- Oliver Niese. An integrated approach to testing complex systems. PhD thesis, Universität Dortmund, 2003.Google Scholar
Digital Library
- Andrew M Pitts. Nominal sets: Names and symmetry in computer science. Cambridge University Press, 2013. Google Scholar
Digital Library
- Ronald L. Rivest and Robert E. Schapire. Inference of finite automata using homing sequences. Inf. Comput., 103(2):299–347, 1993. Google Scholar
Digital Library
- Hiroshi Sakamoto. Learning simple deterministic finite-memory automata. In ALT, pages 416–431, 1997. Google Scholar
- Mark R. Shinwell. Fresh O’Caml: Nominal abstract syntax for the masses. ENTCS, 148(2):53–77, 2006. Google Scholar
Index Terms
Learning nominal automata
Recommendations
Learning nominal automata
POPL '17: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming LanguagesWe 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. ...
Nominal Automata with Name Binding
Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures - Volume 10203Nominal sets are a convenient setting for languages over infinite alphabets, i.e.ï źdata languages. We introduce an automaton model over nominal sets, regular nondeterministic nominal automata RNNA, which have a natural coalgebraic definition using ...
Active Learning for Deterministic Bottom-Up Nominal Tree Automata
Theoretical Aspects of Computing – ICTAC 2022AbstractNominal set plays a central role in a group-theoretic extension of finite automata to those over an infinite set of data values. Moerman et al. proposed an active learning algorithm for nominal word automata with the equality symmetry. In this ...







Comments