Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLukas Fleischer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j9]Lukas Fleischer:
The Cayley Semigroup Membership Problem. Theory Comput. 18: 1-18 (2022)- 2021
- [j8]Lukas Fleischer
, Jeffrey O. Shallit:
Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages. Int. J. Found. Comput. Sci. 32(6): 641-662 (2021) - [j7]Lukas Fleischer, Jeffrey O. Shallit:
Automata, Palindromes, and Reversed Subwords. J. Autom. Lang. Comb. 26(3-4): 221-253 (2021) - 2020
- [j6]Lukas Fleischer, Trevor Jack:
The complexity of properties of transformation semigroups. Int. J. Algebra Comput. 30(03): 585-606 (2020) - [j5]Lukas Fleischer:
The Intersection Problem for Finite Semigroups. Int. J. Found. Comput. Sci. 31(6): 827-842 (2020) - [j4]Lukas Fleischer, Samin Riasat, Jeffrey O. Shallit:
New bounds on antipowers in words. Inf. Process. Lett. 164: 106021 (2020) - [c10]Lukas Fleischer, Jeffrey O. Shallit:
The State Complexity of Lexicographically Smallest Words and Computing Successors. DLT 2020: 83-95 - [i13]Lukas Fleischer, Jeffrey O. Shallit:
The State Complexity of Lexicographically Smallest Words and Computing Successors. CoRR abs/2003.08249 (2020)
2010 – 2019
- 2019
- [j3]Lukas Fleischer, Manfred Kufleitner:
The complexity of weakly recognizing morphisms. RAIRO Theor. Informatics Appl. 53(1-2): 1-17 (2019) - [j2]Lukas Fleischer, Manfred Kufleitner:
Green's Relations in Deterministic Finite Automata. Theory Comput. Syst. 63(4): 666-687 (2019) - [i12]Lukas Fleischer, Jeffrey O. Shallit:
Words Avoiding Reversed Factors, Revisited. CoRR abs/1911.11704 (2019) - [i11]Lukas Fleischer, Jeffrey O. Shallit:
Words With Few Palindromes, Revisited. CoRR abs/1911.12464 (2019) - [i10]Lukas Fleischer, Samin Riasat, Jeffrey O. Shallit:
New Bounds on Antipowers in Binary Words. CoRR abs/1912.08147 (2019) - 2018
- [c9]Lukas Fleischer:
On the Complexity of the Cayley Semigroup Membership Problem. CCC 2018: 25:1-25:12 - [c8]Lukas Fleischer:
The Intersection Problem for Finite Semigroups. DLT 2018: 318-329 - [c7]Lukas Fleischer, Manfred Kufleitner:
Testing Simon's congruence. MFCS 2018: 62:1-62:13 - [c6]Lukas Fleischer, Manfred Kufleitner:
The Intersection Problem for Finite Monoids. STACS 2018: 30:1-30:14 - [i9]Lukas Fleischer:
On The Complexity of the Cayley Semigroup Membership Problem. CoRR abs/1802.00659 (2018) - [i8]Lukas Fleischer, Manfred Kufleitner:
Testing Simon's congruence. CoRR abs/1804.10459 (2018) - [i7]Lukas Fleischer:
Efficient Membership Testing for Pseudovarieties of Finite Semigroups. CoRR abs/1805.00650 (2018) - [i6]Lukas Fleischer:
The Intersection Problem for Finite Semigroups. CoRR abs/1806.04996 (2018) - 2017
- [j1]Lukas Fleischer, Manfred Kufleitner, Alexander Lauser:
The Half-Levels of the FO2 Alternation Hierarchy. Theory Comput. Syst. 61(2): 352-370 (2017) - [c5]Lukas Fleischer, Manfred Kufleitner:
Green's Relations in Finite Transformation Semigroups. CSR 2017: 112-125 - [c4]Volker Diekert, Lukas Fleischer:
Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions. WORDS 2017: 6-16 - [i5]Lukas Fleischer, Manfred Kufleitner:
Green's Relations in Finite Transformation Semigroups. CoRR abs/1703.04941 (2017) - [i4]Volker Diekert, Lukas Fleischer:
Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions. CoRR abs/1707.00101 (2017) - [i3]Lukas Fleischer, Manfred Kufleitner:
The Intersection Problem for Finite Monoids. CoRR abs/1711.08717 (2017) - 2016
- [c3]Lukas Fleischer, Manfred Kufleitner:
Operations on Weakly Recognizing Morphisms. DCFS 2016: 126-137 - [i2]Lukas Fleischer, Manfred Kufleitner:
Operations on Weakly Recognizing Morphisms. CoRR abs/1603.05376 (2016) - 2015
- [c2]Lukas Fleischer, Manfred Kufleitner:
Efficient Algorithms for Morphisms over Omega-Regular Languages. FSTTCS 2015: 112-124 - [i1]Lukas Fleischer, Manfred Kufleitner:
Efficient Algorithms for Morphisms over Omega-Regular Languages. CoRR abs/1509.06215 (2015) - 2014
- [c1]Lukas Fleischer, Manfred Kufleitner, Alexander Lauser:
Block Products and Nesting Negations in FO2. CSR 2014: 176-189
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
