Welcome
I'm a postdoc (Akademischer Rat auf Zeit) at the chair of theoretical computer science at the FAU (University of Erlangen and Nuremberg). Previously, I was a postdoc at the Software Science group at the Radboud University in the Netherlands, a guest researcher at the National Institute of Informatics in Japan, and during a research scholarship at the Australian National University, Canberra, Australia.
My research interests include algorithms powered by category theory, automata learning, and interactive theorem proving (in Agda).
ORCID 0000-0001-8993-6486
Github t-wissmann
DBLP
Google Scholar
GPG 0x1CAFF810
Highlights & News
- The paper Formalized Run-Time Analysis of Active Learning — Coalgebraically in Agda is under review. It includes a formal Agda proof that the L# learning algorithm correctly learns an automaton within at most 𝒪(k·n² + n·log(m)) queries (n = number of states, m = length of longest counterexample, k = alphabet size). You can browse the Agda formalization here.
Software Projects
More software can be found on my github page.
-
herbstluftwm (github page): a manual tiling window manager for unix-related operating systems. If you have any questions or comments on it, then feel free to join
#herbstluftwmon the libera irc network (more information on herbstluftwm.org). There is also a panel: barpyrus. -
CoPaR: A generic minimization tool for coalgebras, in particular for deterministic automata, markov chains, labelled transition systems, Segala systems, and weighted tree automata -- written in haskell. It implements the algorithm from this concur special issue paper and CoPaR itself is presented in this Formal Methods 2019 paper (awarded the Best Theory Paper Award).
-
caligraph: a terminal-ui calendar application, written in haskell, currently supporting only remind calendars.
-
train shunting puzzles: Web application for solving train shunting puzzles, written in the purely functional language elm (source code).
Contact
edu _at_ thorsten-wissmann.de