Lukas Fleischer

Available identifiers

Publication	Date of Publication	Type
Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages	2023-08-15	Paper
The State Complexity of Lexicographically Smallest Words and Computing Successors	2022-10-13	Paper
https://portal.mardi4nfdi.de/entity/Q5077150	2022-05-18	Paper
https://portal.mardi4nfdi.de/entity/Q5061525	2022-03-11	Paper
https://portal.mardi4nfdi.de/entity/Q5005165	2021-08-04	Paper
The Intersection Problem for Finite Semigroups	2021-04-19	Paper
New bounds on antipowers in words	2020-10-07	Paper
https://portal.mardi4nfdi.de/entity/Q5121913	2020-09-22	Paper
The intersection problem for finite monoids	2020-08-05	Paper
The complexity of properties of transformation semigroups	2020-04-16	Paper
Words With Few Palindromes, Revisited	2019-11-27	Paper
Words Avoiding Reversed Factors, Revisited	2019-11-26	Paper
The complexity of weakly recognizing morphisms	2019-07-18	Paper
Green's relations in deterministic finite automata	2019-07-04	Paper
The intersection problem for finite semigroups	2018-11-22	Paper
Church-Rosser systems, codes with bounded synchronization delay and local Rees extensions	2017-11-15	Paper
The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy	2017-10-20	Paper
Green's relations in finite transformation semigroups	2017-08-22	Paper
https://portal.mardi4nfdi.de/entity/Q5278314	2017-07-13	Paper
Operations on Weakly Recognizing Morphisms	2016-11-09	Paper
Block Products and Nesting Negations in FO2	2014-06-24	Paper

This page was built for person: Lukas Fleischer