Alexander Lauser

According to our database1, Alexander Lauser authored at least 16 papers between 2010 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
The Half-Levels of the FO2 Alternation Hierarchy.
Theory Comput. Syst., 2017

2015
Formal language theory of logic fragments.
PhD thesis, 2015

2014
Block Products and Nesting Negations in FO2.
Proceedings of the Computer Science - Theory and Applications, 2014

2013
Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2012
Around dot-Depth One.
Int. J. Found. Comput. Sci., 2012

The Join of R-trivial and L-trivial Monoids via Combinatorics on Words.
Discret. Math. Theor. Comput. Sci., 2012

Lattices of Logical Fragments over Words
CoRR, 2012

Regular Ideal Languages and Their Boolean Combinations.
Proceedings of the Implementation and Application of Automata, 2012

The Join Levels of the Trotter-Weil Hierarchy Are Decidable.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Lattices of Logical Fragments over Words - (Extended Abstract).
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Partially Ordered Two-Way BüChi Automata.
Int. J. Found. Comput. Sci., 2011

Cantor Topologies for Finite Words
CoRR, 2011

First-order Fragments with Successor over Infinite Words.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Languages of Dot-Depth One over Infinite Words.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010
Rankers over Infinite Words
CoRR, 2010

Rankers over Infinite Words - (Extended Abstract).
Proceedings of the Developments in Language Theory, 14th International Conference, 2010


  Loading...