Rankers over Infinite Words - (Extended Abstract). - Luc Dartois; Manfred Kufleitner; Alexander Lauser (Developments in Language Theory, 2010)

Rankers over Infinite Words - Luc Dartois; Manfred Kufleitner; Alexander Lauser (CoRR, 2010)

Languages of Dot-Depth One over Infinite Words. - Manfred Kufleitner; Alexander Lauser (LICS, 2011)

First-order Fragments with Successor over Infinite Words. - Jakub Kallas; Manfred Kufleitner; Alexander Lauser (STACS, 2011)

Cantor Topologies for Finite Words - Manfred Kufleitner; Alexander Lauser (CoRR, 2011)

Partially Ordered Two-Way BüChi Automata. - Manfred Kufleitner; Alexander Lauser (Int. J. Found. Comput. Sci., 2011)

Lattices of Logical Fragments over Words - (Extended Abstract). - Manfred Kufleitner; Alexander Lauser (ICALP (2), 2012)

The Join Levels of the Trotter-Weil Hierarchy Are Decidable. - Manfred Kufleitner; Alexander Lauser (MFCS, 2012)

Regular Ideal Languages and Their Boolean Combinations. - Franz Jahn; Manfred Kufleitner; Alexander Lauser (CIAA, 2012)

Lattices of Logical Fragments over Words - Manfred Kufleitner; Alexander Lauser (CoRR, 2012)

The Join of R-trivial and L-trivial Monoids via Combinatorics on Words. - Manfred Kufleitner; Alexander Lauser (Discret. Math. Theor. Comput. Sci., 2012)

Around dot-Depth One. - Manfred Kufleitner; Alexander Lauser (Int. J. Found. Comput. Sci., 2012)

Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable. - Manfred Kufleitner; Alexander Lauser (STACS, 2013)

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

Formal language theory of logic fragments. - Alexander Lauser (2015)

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