default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Lauser
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j4]Lukas Fleischer, Manfred Kufleitner
, Alexander Lauser:
The Half-Levels of the FO2 Alternation Hierarchy. Theory Comput. Syst. 61(2): 352-370 (2017)- 2015
- [b1]Alexander Lauser:
Formal language theory of logic fragments. University of Stuttgart, 2015 - 2014
- [c10]Lukas Fleischer, Manfred Kufleitner, Alexander Lauser:
Block Products and Nesting Negations in FO2. CSR 2014: 176-189 - 2013
- [c9]Manfred Kufleitner, Alexander Lauser:
Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable. STACS 2013: 305-316 - 2012
- [j3]Manfred Kufleitner, Alexander Lauser:
The Join of R-trivial and L-trivial Monoids via Combinatorics on Words. Discret. Math. Theor. Comput. Sci. 14(1): 141-146 (2012) - [j2]Manfred Kufleitner, Alexander Lauser:
Around dot-Depth One. Int. J. Found. Comput. Sci. 23(6): 1323-1340 (2012) - [c8]Manfred Kufleitner, Alexander Lauser:
Lattices of Logical Fragments over Words - (Extended Abstract). ICALP (2) 2012: 275-286 - [c7]Manfred Kufleitner, Alexander Lauser:
The Join Levels of the Trotter-Weil Hierarchy Are Decidable. MFCS 2012: 603-614 - [c6]Franz Jahn, Manfred Kufleitner, Alexander Lauser:
Regular Ideal Languages and Their Boolean Combinations. CIAA 2012: 205-216 - [i10]Manfred Kufleitner, Alexander Lauser:
Lattices of Logical Fragments over Words. CoRR abs/1202.3355 (2012) - [i9]Manfred Kufleitner, Alexander Lauser:
The Join Levels of the Trotter-Weil Hierarchy are Decidable. CoRR abs/1204.4672 (2012) - [i8]Manfred Kufleitner, Alexander Lauser:
The Join of R-trivial and L-trivial Monoids via Combinatorics on Words. CoRR abs/1204.5368 (2012) - [i7]Manfred Kufleitner, Alexander Lauser:
Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable. CoRR abs/1212.6500 (2012) - 2011
- [j1]Manfred Kufleitner, Alexander Lauser:
Partially Ordered Two-Way BüChi Automata. Int. J. Found. Comput. Sci. 22(8): 1861-1876 (2011) - [c5]Manfred Kufleitner, Alexander Lauser:
Around Dot-Depth One. AFL 2011: 255-269 - [c4]Manfred Kufleitner, Alexander Lauser:
Languages of Dot-Depth One over Infinite Words. LICS 2011: 23-32 - [c3]Jakub Kallas, Manfred Kufleitner, Alexander Lauser:
First-order Fragments with Successor over Infinite Words. STACS 2011: 356-367 - [i6]Jakub Kallas, Manfred Kufleitner, Alexander Lauser:
First-order Fragments with Successor over Infinite Words. CoRR abs/1101.0115 (2011) - [i5]Manfred Kufleitner, Alexander Lauser:
Languages of Dot-depth One over Infinite Words. CoRR abs/1101.4152 (2011) - [i4]Manfred Kufleitner, Alexander Lauser:
Cantor Topologies for Finite Words. CoRR abs/1102.5013 (2011) - [i3]Manfred Kufleitner, Alexander Lauser:
Around Dot-depth One. CoRR abs/1103.1353 (2011) - 2010
- [c2]Luc Dartois, Manfred Kufleitner, Alexander Lauser:
Rankers over Infinite Words - (Extended Abstract). Developments in Language Theory 2010: 148-159 - [c1]Manfred Kufleitner, Alexander Lauser:
Partially Ordered Two-Way Büchi Automata. CIAA 2010: 181-190 - [i2]Luc Dartois, Manfred Kufleitner, Alexander Lauser:
Rankers over Infinite Words. CoRR abs/1005.0505 (2010) - [i1]Manfred Kufleitner, Alexander Lauser:
Partially Ordered Two-way Büchi Automata. CoRR abs/1006.2719 (2010)
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-25 05:43 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:
