joshua/phd-thesis
Archived
1
Fork 0
Code Activity

Cleaned up the bib a bit

Browse source
This commit is contained in:
Joshua Moerman 2019-05-23 09:40:22 +02:00
parent d705b27a57
commit 27fe1b69b7
4 changed files with 297 additions and 428 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

21
biblio-eigen.bib
View file

@ -6,9 +6,7 @@
Ana Rosa Cavalli and
H{\"{u}}sn{\"{u}} Yenig{\"{u}}n},
title = {$n$-Complete Test Suites for {IOCO}},
booktitle_= {Testing Software and Systems - 29th {IFIP} {WG} 6.1 International
Conference, {ICTSS} 2017, St. Petersburg, Russia, October 9-11, 2017,
Proceedings},
booktitle_= {Testing Software and Systems - 29th {IFIP} {WG} 6.1 International Conference, {ICTSS}, Proceedings},
booktitle = {{ICTSS} 2017 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10533},
@ -43,9 +41,7 @@
Sylvain Conchon and
Fatiha Za{\"{\i}}di},
title = {Applying Automata Learning to Embedded Control Software},
booktitle_= {Formal Methods and Software Engineering - 17th International Conference
on Formal Engineering Methods, {ICFEM} 2015, Paris, France, November
3-5, 2015, Proceedings},
booktitle_= {Formal Methods and Software Engineering - 17th International Conference on Formal Engineering Methods, {ICFEM}, Proceedings},
booktitle = {{ICFEM} 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9407},
@ -68,9 +64,7 @@
Carlos Mart{\'{\i}}n{-}Vide and
Bianca Truthe},
title = {Minimal Separating Sequences for All Pairs of States},
booktitle_= {Language and Automata Theory and Applications - 10th International
Conference, {LATA} 2016, Prague, Czech Republic, March 14-18, 2016,
Proceedings},
booktitle_= {Language and Automata Theory and Applications - 10th International Conference, {LATA}, Proceedings},
booktitle = {{LATA} 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9618},
@ -110,9 +104,7 @@
editor = {Giuseppe Castagna and
Andrew D. Gordon},
title = {Learning nominal automata},
booktitle_= {Proceedings of the 44th {ACM} {SIGPLAN} Symposium on Principles of
Programming Languages, {POPL} 2017, Paris, France, January 18-20,
2017},
booktitle_= {Proceedings of the 44th {ACM} {SIGPLAN} Symposium on Principles of Programming Languages, {POPL}},
booktitle = {{POPL} 2017, Proceedings},
pages = {613--625},
publisher = {{ACM}},
@ -129,7 +121,7 @@
editor = {Olgierd Unold and
Witold Dyrka and
Wojciech Wieczorek},
booktitle = {ICGI 2018, Proceedings},
booktitle = {International Conference on Grammatical Inference, {ICGI}, Proceedings},
publisher = {Proceedings of Machine Learning Research},
volume = {93},
year = {2019},
@ -151,8 +143,7 @@
editor = {Bernd Fischer and
Tarmo Uustalu},
title = {Fast Computations on Ordered Nominal Sets},
booktitle_= {Theoretical Aspects of Computing - {ICTAC} 2018 - 15th International
Colloquium, Stellenbosch, South Africa, October 16-19, 2018, Proceedings},
booktitle_= {Theoretical Aspects of Computing - {ICTAC} - 15th International Colloquium, Proceedings},
booktitle = {{ICTAC} 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11187},

699
biblio.bib
View file

File diff suppressed because it is too large Load diff

4
content/separated-nominal-automata.tex
View file

@ -874,7 +874,7 @@ In this section we revisit the above results from this perspective, and generali
In particular, we retrieve the extension from separated languages to $\sb$-languages, by establishing $\sb$-languages as a final separated automaton.
The latter result follows by instantiating a well-known technique for lifting adjunctions to categories of coalgebras, using the results of \in{Section}[sec:adjunction].
In the remainder of this section we assume familiarity with the theory
of coalgebras, see, e.g., \citet[jacobs-coalg, Rutten00].
of coalgebras, see, e.g., \citet[Jacobs16, Rutten00].
\startdefinition[reference=def:nominal-aut-coalg]
Let $M$ be a submonoid of $\sb$, and let $\Sigma$, $O$
@ -915,7 +915,7 @@ Next, we provide an alternative final $\sa$-coalgebra which assigns $\sb$-nomina
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 regularly in the coalgebraic study
of automata \citep[JSS14, KlinR16, KerstanKW14].
of automata \citep[JacobsSS15, KlinR16, KerstanKW14].
\starttheorem[reference=thm:adjunction-lift]
Let $\Sigma$ be a $\perm$-set, and $O$ an $\sb$-set.

1
environment/bib.tex
View file

@ -20,6 +20,7 @@
% The dblp database ignores Pauls nice a-breve and s-comma
\btxremapauthor [Paul Fiterau{-}Brostean] [Paul Fiterău-Broștean]
\btxremapauthor [Daniela Petrisan] [Daniela Petrișan]
% The \l does not work well, but unicode is fine
\btxremapauthor [Michal Szynwelski] [Michał Szynwelski]