Regular languages and partial commutations, Information and Computation, vol.230, pp.76-96, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-01247172
Learning regular sets from queries and counterexamples, Information and Computation, vol.75, issue.2, pp.87-106, 1987. ,
DOI : 10.1016/0890-5401(87)90052-6
URL : http://doi.org/10.1016/0890-5401(87)90052-6
Learning Communicating Automata from MSCs, IEEE Transactions on Software Engineering, vol.36, issue.3, pp.390-408, 2010. ,
DOI : 10.1109/TSE.2009.89
URL : https://hal.archives-ouvertes.fr/hal-00779922
libalf: The Automata Learning Framework, Computer Aided Verification, 22nd International Conference, CAV 2010. Proceedings, pp.360-364, 2010. ,
DOI : 10.1007/978-3-642-14295-6_32
URL : https://hal.archives-ouvertes.fr/hal-00779934
Muller message-passing automata and logics, Zoltán Ésik, Carlos Martín-Vide, and Victor Mitrana Preliminary Proceedings of the 1st International Conference on Language and Automata Theory and Applications (LATA'07), 2007. ,
DOI : 10.1016/j.ic.2008.03.010
URL : http://doi.org/10.1016/j.ic.2008.03.010
Permutation rewriting and algorithmic verification, LICS, 2001. ,
DOI : 10.1109/lics.2001.932515
URL : https://hal.archives-ouvertes.fr/hal-00161120
Permutation rewriting and algorithmic verification, Information and Computation, vol.205, issue.2, pp.199-224, 2007. ,
DOI : 10.1016/j.ic.2005.11.007
URL : https://hal.archives-ouvertes.fr/hal-00161120
Modelbased testing using symbolic animation and machine learning, Third International Conference on Software Testing, Verification and Validation, ICST 2010, Workshops Proceedings, pp.355-360, 2010. ,
Sampling different kinds of acyclic automata using Markov chains, Theoretical Computer Science, vol.450, pp.31-42, 2012. ,
DOI : 10.1016/j.tcs.2012.04.025
URL : https://hal.archives-ouvertes.fr/hal-00841870
Efficiency of automata in semi-commutation verification techniques, ITA, vol.42, issue.2, pp.197-215, 2008. ,
Learning regular languages using RFSAs, Theoretical Computer Science, vol.313, issue.2, pp.267-294, 2004. ,
DOI : 10.1016/j.tcs.2003.11.008
Handbook of Formal Languages, chapter Partial Commutation and Traces, 1997. ,
Antichain Algorithms for Finite Automata, 16th International Conference, TACAS 2010. Proceedings, pp.2-22, 2010. ,
DOI : 10.1007/978-3-642-12002-2_2
Reachability sets of parameterized rings as regular languages, Electronic Notes in Theoretical Computer Science, vol.9, p.40, 1997. ,
DOI : 10.1016/S1571-0661(05)80427-X
Semigroups, Presburger formulas, and languages, Pacific Journal of Mathematics, vol.16, issue.2, pp.285-296, 1966. ,
DOI : 10.2140/pjm.1966.16.285
When Does Partial Commutative Closure Preserve Regularity?, Lecture Notes in Computer Science, vol.5126, issue.2, pp.209-220, 2008. ,
DOI : 10.1007/978-3-540-70583-3_18
On the trace product and some families of languages closed under partial commutations, Journal of Automata, Languages and Combinatorics, vol.9, issue.1, pp.61-79, 2004. ,
A note on partially ordered tree automata, Information Processing Letters, vol.108, issue.4, pp.242-246, 2008. ,
DOI : 10.1016/j.ipl.2008.05.012
LearnLib Tutorial: From Finite Automata to Register Interface Programs, Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change - 5th International Symposium, pp.587-590, 2012. ,
DOI : 10.1007/978-3-642-34026-0_43
URL : https://hal.archives-ouvertes.fr/hal-00767425
An Introduction to Computational Learning Theory, 1994. ,
Computing the closure of sets of words under partial commutations, Lecture Notes in Computer Science, vol.944, pp.75-86, 1995. ,
DOI : 10.1007/3-540-60084-1_64
A note on the commutative closure of star-free languages, Information Processing Letters, vol.57, issue.2, pp.71-74, 1996. ,
DOI : 10.1016/0020-0190(95)00187-5
Etude du comportement en moyenne des automates finis et des langages rationnels, 2000. ,
Inferring regular languages in polynomial update time, Pattern Recognition and Image Analysis, pp.49-61, 1992. ,
Polynomial closure of group languages and open sets of the Hall topology, Theoretical Computer Science, vol.169, issue.2, pp.185-200, 1996. ,
DOI : 10.1016/S0304-3975(96)00120-X
URL : https://hal.archives-ouvertes.fr/hal-00020074
Dynamic testing via automata learning, International Journal on Software Tools for Technology Transfer, vol.17, issue.6, pp.307-324, 2009. ,
DOI : 10.1007/s10009-009-0120-7
URL : https://hal.archives-ouvertes.fr/inria-00459956
Inference of finite automata using homing sequences (extended abstract), Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp.411-420, 1989. ,
The ???last??? decision problem for rational trace languages, Lecture Notes in Computer Science, vol.583, pp.460-473, 1992. ,
DOI : 10.1007/BFb0023848
Elements of Automata Theory, 2013. ,
DOI : 10.1017/CBO9781139195218
Analysis and testing of black-box component-based systems by inferring partial models, Software Testing, Verification and Reliability, vol.118, issue.4, pp.253-288, 2014. ,
DOI : 10.1002/stvr.1491
URL : https://hal.archives-ouvertes.fr/hal-00974760
Learning to verify branching time properties, 20th IEEE/ACM International Conference on Automated Software Engineering (ASE 2005), pp.325-328, 2005. ,