About me

I am Joshua Moerman, a computer scientist. Currently, I am a researcher at the RWTH Aachen in the MOVES group. I am working on probabilistic programs as a member of the FRAPPANT project.

Formerly, I was a PhD student at the Radboud University in Nijmegen at the Software Science department. Under supervision of Frits Vaandrager, Bas Terwijn, and Alexandra Silva I worked on active automata learning and nominal automata.

My research interests also include formal verification, PAC learning, coalgebraic methods, functional programming, black-box testing theory, and category theory. Some of the software I write during my research can be found on Gitlab. Other bits and pieces of software can be found on Github.

Recent Publications (more)

  • (2019) A (co)algebraic theory of succinct automata - Gerco van Heerdt, Joshua Moerman, Matteo Sammartino, and Alexandra Silva. JLAMP. [ Abstract ]

  • (2018) Fast Computations on Ordered Nominal Sets - David Venhoek, Joshua Moerman and Jurriaan Rot. ICTAC 2018. [ Abstract ]

  • (2018) Learning Product Automata - Joshua Moerman. ICGI 2018. [ Abstract ]

  • (2017) n-Complete Test Suites for IOCO - Petra van den Bos, Ramon Janssen and Joshua Moerman. ICTSS 2017. [ Abstract ]

I list some of my talks here. I gave an introductionary talk on automata learning for some friends of mine, it can be found on Youtube.


  • Master Mathematics (algebra and topology) 2013 - 2015, Radboud University. My master thesis was on Rational Homotopy Theory, supervised by Ieke Moerdijk.

  • Bachelor Computer Science 2009-2013, Radboud University.

  • Bachelor Mathematics 2009-2013, Radboud University.


CV and Contact

Grab my CV here. Contact me via joshua at cs dot rwth-aachen dot de or via one of these: [ Linkedin ] [ Github ] [ Twitter ] [ Vimeo ]