Changed title of Chap 7. Two small fixes by Leon.

biblio-eigen.bib

@@ -139,7 +139,7 @@
 @misc{MoermanR19,
 	author    = {Joshua Moerman and
 	             Jurriaan Rot},
-	title     = {Separated Nominal Automata},
+	title     = {Separation and Renaming in Nominal Sets},
 	note      = {Under submission},
 	year      = {2019}
 }

biblio.bib

@@ -1118,8 +1118,9 @@
 	booktitle = {International Conference on Grammatical Inference, ICGI 2018},
 	pages     = {30--43},
 	publisher = {Proceedings of Machine Learning Research},
+	volume    = {93},
 	year      = {2018},
-	note      = {Wachten op doi?}
+	note      = {To appear}
 }
 
 @inproceedings{HansenKLMPS10,

content.tex

@@ -12,7 +12,7 @@
 \midaligned{Joshua Moerman}
 \midaligned{Radboud University}
 \midaligned{Nijmegen, the Netherlands}
-\midaligned{11 January 2019}
+\midaligned{28 January 2019}
 \stop
 \page[yes]
 

content/introduction.tex

@@ -5,7 +5,7 @@
   [title={Introduction},
    reference=chap:introduction]
 
-When I was younger, I often learned how to play with new toys by messing about with them, i.e., by pressing buttons at random, observing their behaviour, pressing more buttons, and so on.
+When I was younger, I often learned how to play with new toys by messing about with them, by pressing buttons at random, observing their behaviour, pressing more buttons, and so on.
 Only resorting to the manual -- or asking \quotation{experts} -- to confirm my beliefs on how the toys work.
 Now that I am older, I do mostly the same with new devices, new tools, and new software.
 However, now I know that this is an established computer science technique, called \emph{model learning}.
@@ -23,7 +23,7 @@ This thesis is about model learning and related techniques.
 In the first part, I present results concerning \emph{black box testing} of automata.
 Testing is a crucial part in learning software behaviour and often remains a bottleneck in applications of model learning.
 In the second part, I show how \emph{nominal techniques} can be used to learn automata over structured infinite alphabets.
-The study on nominal automata was directly motivated by work on learning networks protocols which rely on identifiers or sequence numbers.
+The study on nominal automata was directly motivated by work on learning network protocols which rely on identifiers or sequence numbers.
 
 But before we get ahead of ourselves, we should first understand what we mean by learning, as learning means very different things to different people.
 In educational science, learning may involve concepts such as teaching, blended learning, and interdisciplinarity.
@@ -538,7 +538,7 @@ This is based on the following publication:
 \cite[entry][VenhoekMR18].
 \stopcontribution
 
-\startcontribution[title={Chapter \ref[default][chap:separated-nominal-automata]: Separated nominal automata.}]
+\startcontribution[title={Chapter \ref[default][chap:separated-nominal-automata]: Separation and Renaming in Nominal Sets.}]
 We investigate how to reduce the size of certain nominal automata.
 This is based on the observation that some languages (with outputs) are not just invariant under symmetries, but invariant under arbitrary \emph{transformations}, or \emph{renamings}.
 We define a new type of automaton, the \emph{separated nominal automaton}, and show that they exactly accept those languages which are closed under renamings.

content/separated-nominal-automata.tex

@@ -2,7 +2,7 @@
 \startcomponent separated-nominal-automata
 
 \startchapter
-  [title={Separated Nominal Automata},
+  [title={Separation and Renaming in Nominal Sets},
    reference=chap:separated-nominal-automata]
 
 \midaligned{~
@@ -13,7 +13,7 @@
 \startabstract
 Nominal sets provide a foundation for reasoning about names.
 They are used primarily in syntax with binders, but also, e.g., to model automata over infinite alphabets.
-In this paper, nominal sets are related to \emph{nominal renaming sets}, which involve arbitrary substitutions rather than permutations, through a categorical adjunction.
+In this chapter, nominal sets are related to \emph{nominal renaming sets}, which involve arbitrary substitutions rather than permutations, through a categorical adjunction.
 In particular, the separated product of nominal sets is related to the Cartesian product of nominal renaming sets.
 Based on these results, we define the new notion of \emph{separated nominal automata}.
 These efficiently recognise nominal languages, provided these languages are renaming sets.
@@ -914,7 +914,7 @@ such that the unique coalgebra homomorphism from a given $\sa$-coalgebra $(Q,\la
 Next, we provide an alternative final $\sa$-coalgebra which assigns $\sb$-nominal languages to states of separated nominal automata.
 The essence is to obtain a final $\sa$-coalgebra from the final $B_{\sb}$-coalgebra.
 In order to prove this, we use a technique to lift adjunctions to categories of coalgebras.
-This technique occurs more often in the coalgebraic study
+This technique occurs regularly in the coalgebraic study
 of automata \citep[JSS14, KlinR16, KerstanKW14].
 
 \starttheorem[reference=thm:adjunction-lift]

content/test-methods.tex

@@ -203,7 +203,7 @@ We define the following kinds of sequences.
 
 The above list is ordered from weaker to stronger notions, i.e., every distinguishing sequence is an UIO sequence for every state.
 Similarly, an UIO for a state $s$ is a separating sequence for $s$ and any inequivalent $t$.
-Separating sequences always exist for inequivalent states and finding them efficiently is the topic of \in{Chapter}[chap:separating-sequences].
+Separating sequences always exist for inequivalent states and finding them efficiently is the topic of \in{Chapter}[chap:minimal-separating-sequences].
 On the other hand, UIOs and DSs do not always exist for a machine.
 
 A machine $M$ is \emph{minimal} if every distinct pair of states is inequivalent (i.e.,\break $s \sim t \implies s = t$).

environment/pdf.tex

@@ -7,6 +7,13 @@
 % Klikbare referenties
 \setupinteraction[state=start, focus=standard, contrastcolor=darkgreen, style=normal]
 
+% Metadata
+\setupinteraction
+  [title={Nominal Techniques and Black Box Testing for Automata Learning},
+   author={Joshua Moerman},
+   date={14 January 2019},
+   keyword={Nominal techniques, Black box testing, Automata learning}]
+
 % Bookmarks in de pdf
 \placebookmarks[chapter,section]