M. Bielecki, J. Hidders, J. Paredaens, J. Tyszkiewicz, and J. Van-den-bussche, Navigating with a browser, Automata, Languages and Programming, 2002.
DOI : 10.1007/3-540-45465-9_65

M. Boja?czyk, Nominal monoids. Theory of Computing Systems, vol.53, pp.194-222, 2013.

M. Boja?czyk, Slightly infinite sets. A draft of a book, 2017.

M. Boja?czyk, B. Klin, and S. Lasota, Automata theory in nominal sets, Logical Methods in Computer Science, vol.10, issue.3, pp.1-44, 2014.

B. Bollig, P. Habermehl, M. Leucker, and B. Monmege, A robust class of data languages and an application to learning, Logical Methods in Computer Science, vol.10, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00920945

P. Brunet and D. Pous, A Formal Exploration of Nominal Kleene Algebra, MFCS, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01307532

J. Gabbay, D. R. Ghica, and D. Petri?an, Leaving the Nest: Nominal Techniques for Variables with Interleaving Scopes, CSL, vol.41, 2015.

M. Kaminski and N. Francez, Finite-memory automata, Theoretical Computer Science, vol.134, issue.2, pp.329-363, 1994.
DOI : 10.1109/fscs.1990.89590

M. Kaminski and T. Tan, Regular expressions for languages over infinite alphabets, Computing and Combinatorics, 2004.
DOI : 10.1007/978-3-540-27798-9_20

K. Dexter-kozen, A. Mamouras, and . Silva, Completeness and incompleteness in nominal kleene algebra, Relational and Algebraic Methods in Computer Science, 2015.

K. Dexter-kozen, A. Mamouras, D. Silva, and . Petri?an, Nominal Kleene Coalgebra. In ICALP, vol.9135, pp.290-302, 2015.

A. Kurz, T. Suzuki, and E. Tuosto, A characterisation of languages on infinite alphabets with nominal regular expressions, Theoretical Computer Science, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01556226

A. Kurz, T. Suzuki, and E. Tuosto, On nominal regular languages with binders, Foundations of Software Science and Computational Structures, 2012.
DOI : 10.1007/978-3-642-28729-9_17

L. Libkin, T. Tan, and D. Vrgo?, Regular Expressions for Data Scientists, Journal of Computer and System Sciences, vol.81, issue.7, pp.1278-1287, 2015.
DOI : 10.1016/j.jcss.2015.03.005
URL : https://www.pure.ed.ac.uk/ws/files/20039402/regular_v_jcss_final.pdf

S. Andrzej, . Murawski, J. Steven, N. Ramsay, and . Tzevelekos, Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata, MFCS, 2018.

F. Neven, T. Schwentick, and V. Vianu, Finite state machines for strings over infinite alphabets, ACM Transactions on Computational Logic, vol.5, issue.3, pp.403-435, 2004.
DOI : 10.1145/1013560.1013562

A. M. Pitts, Nominal Sets: Names and Symmetry in Computer Science, 2013.
DOI : 10.1109/lics.2015.12

L. Schröder, D. Kozen, S. Milius, and T. Wißmann, Nominal Automata with Name Binding, FoSSaCS, pp.124-142, 2017.

T. Schwentick, Automata for xml-a survey, Journal of Computer and System Sciences, vol.73, issue.3, pp.289-315, 2007.
DOI : 10.1016/j.jcss.2006.10.003
URL : https://doi.org/10.1016/j.jcss.2006.10.003