Block Products and Nesting Negations in FO2. - Lukas Fleischer; Manfred Kufleitner; Alexander Lauser (CSR, 2014)

Efficient Algorithms for Morphisms over Omega-Regular Languages. - Lukas Fleischer; Manfred Kufleitner (FSTTCS, 2015)

Operations on Weakly Recognizing Morphisms. - Lukas Fleischer; Manfred Kufleitner (DCFS, 2016)

Green's Relations in Finite Transformation Semigroups. - Lukas Fleischer; Manfred Kufleitner (CSR, 2017)

Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions. - Volker Diekert; Lukas Fleischer (WORDS, 2017)

The Half-Levels of the FO2 Alternation Hierarchy. - Lukas Fleischer; Manfred Kufleitner; Alexander Lauser (Theory Comput. Syst., 2017)

On the Complexity of the Cayley Semigroup Membership Problem. - Lukas Fleischer (CCC, 2018)

Testing Simon's congruence. - Lukas Fleischer; Manfred Kufleitner (MFCS, 2018)

The Intersection Problem for Finite Monoids. - Lukas Fleischer; Manfred Kufleitner (STACS, 2018)

Efficient Membership Testing for Pseudovarieties of Finite Semigroups. - Lukas Fleischer (CoRR, 2018)

Words Avoiding Reversed Factors, Revisited. - Lukas Fleischer; Jeffrey O. Shallit (CoRR, 2019)

Words With Few Palindromes, Revisited. - Lukas Fleischer; Jeffrey O. Shallit (CoRR, 2019)

New Bounds on Antipowers in Binary Words. - Lukas Fleischer; Samin Riasat; Jeffrey O. Shallit (CoRR, 2019)

The complexity of weakly recognizing morphisms. - Lukas Fleischer; Manfred Kufleitner (RAIRO Theor. Informatics Appl., 2019)

Green's Relations in Deterministic Finite Automata. - Lukas Fleischer; Manfred Kufleitner (Theory Comput. Syst., 2019)

The State Complexity of Lexicographically Smallest Words and Computing Successors. - Lukas Fleischer; Jeffrey O. Shallit (DLT, 2020)

The complexity of properties of transformation semigroups. - Lukas Fleischer; Trevor Jack (Int. J. Algebra Comput., 2020)

The Intersection Problem for Finite Semigroups. - Lukas Fleischer (Int. J. Found. Comput. Sci., 2020)

New bounds on antipowers in words. - Lukas Fleischer; Samin Riasat; Jeffrey O. Shallit (Inf. Process. Lett., 2020)

Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages. - Lukas Fleischer; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2021)

Automata, Palindromes, and Reversed Subwords. - Lukas Fleischer; Jeffrey O. Shallit (J. Autom. Lang. Comb., 2021)

The Cayley Semigroup Membership Problem. - Lukas Fleischer (Adv. Math. Commun., 2022)

Membership and Conjugacy in Inverse Semigroups. - Lukas Fleischer; Florian Stober; Alexander Thumm; Armin Weiß (ICALP, 2025)