From August 2015 to April 2019, I was a research assistant in the Institute for Formal Methods in Computer Science at the University of Stuttgart. From May 2019 to December 2019, I was a postdoctoral researcher in the Cheriton School of Computer Science at the University of Waterloo, working with Jeffrey Shallit. My primary research areas are automata theory, formal languages, semigroup theory, algorithms, computational complexity and formal verification. A list of my publications can be found here and on DBLP.
I actively contribute to several open source projects. Please scroll down for a (not necessarily complete) list.
|05/2019-12/2019||Postdoctoral Fellow, School of Computer Science, University of Waterloo|
|02/2019-04/2019||Research Assistant, FMI, University of Stuttgart|
|08/2015-02/2019||Ph.D. Computer Science, FMI, University of Stuttgart|
|04/2015-07/2015||Teaching Assistant, University of Stuttgart|
|10/2013-05/2015||M.Sc. Computer Science, University of Stuttgart|
|10/2010-11/2013||B.Sc. Computer Science, University of Stuttgart|
|2000-2009||High School, Gymnasien im Ellental, Bietigheim-Bissingen|
|1996-2000||Elementary School, Grundschule im Sand, Bietigheim-Bissingen|
- Lukas Fleischer and Manfred Kufleitner. Testing Simon's congruence. MFCS 2018.
- Lukas Fleischer. The Intersection Problem for Finite Semigroups. DLT 2018.
- Lukas Fleischer. On the Complexity of the Cayley Semigroup Membership Problem. CCC 2018.
- Lukas Fleischer and Manfred Kufleitner. The Intersection Problem for Finite Monoids. STACS 2018.
- Volker Diekert and Lukas Fleischer. Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions. WORDS 2017.
- Lukas Fleischer and Manfred Kufleitner. Green's Relations in Finite Transformation Semigroups. CSR 2017.
- Lukas Fleischer and Manfred Kufleitner. Operations on Weakly Recognizing Morphisms. DCFS 2016.
- Lukas Fleischer and Manfred Kufleitner. Efficient Algorithms for Morphisms over Omega-Regular Languages. FSTTCS 2015.
- Lukas Fleischer, Manfred Kufleitner and Alexander Lauser. Block Products and Nesting Negations in FO2. CSR 2014.
- Lukas Fleischer and Manfred Kufleitner. The Complexity of Operations on Weakly Recognizing Morphisms. RAIRO-Theor. Inf. Appl., volume 53, number 1-2, pp 1–17. EDP Sciences, 2018.
- Lukas Fleischer and Manfred Kufleitner. Green's Relations in Deterministic Finite Automata. Theory of Computing Systems, volume 63, issue 4, pp 666–687. Springer, 2018.
- Lukas Fleischer, Manfred Kufleitner and Alexander Lauser. The Half-Levels of the FO2 Alternation Hierarchy. Theory of Computing Systems, volume 61, issue 2, pp 352–370. Springer, 2017.
- Lukas Fleischer and Jeffrey Shallit. Words With Few Palindromes, Revisited. Technical report.
- Lukas Fleischer and Jeffrey Shallit. Words Avoiding Reversed Factors, Revisited. Technical report.
- Lukas Fleischer. Algorithms and Complexity Results for Finite Semigroups. PhD thesis.
- Lukas Fleischer. Efficient Membership Testing for Pseudovarieties of Finite Semigroups. Technical report.
I am the current maintainer of calcurse, a powerful command-line based calendar program.
I am a regular contributor to cgit, a hyperfast web frontend for Git repositories written in C.
In late 2017, I started co-maintaining jpeg-archive, a utility to compress JPEG images for long-term storage without sacrificing perceived visual quality.
aurdupes is a Python script that can be used to find duplicate packages in pacman databases and the Arch User Repository.
cdlib-eject is a lightweight C program to control Dacal CD Library II devices.
Open Source Contributions
I occasionally contribute to other projects, such as
Please do not send emails to
Lukas Fleischer <email@example.com>.
Lukas Fleischer <firstname.lastname@example.org>
2E36 D862 0221 482F C45C B7F2 A917 6475 9326 B440