Martin Luther University Halle-Wittenberg


Prof. Dr. Ludwig Staiger

phone: +49 345 5524714

room 219
Institut für Informatik
Von-Seckendorff-Platz 1
06120 Halle

How to reach us

Further settings

Login for editors

Prof. Dr. Ludwig Staiger

Portrait von Prof. Dr. Ludwig Staiger

Portrait von Prof. Dr. Ludwig Staiger

Prof. Dr. Ludwig Staiger (*1948, Jena) studied Mathematics at the Friedrich-Schiller-Universität Jena   (Diplom 1970, Promotion 1977, Habilitation 1979). From 1970 till 1973 he had a postgraduate study at the Yerevan State University (with Prof. R. R. Varshamov). From 1973 till 1982 he was staff member at the mathematical department  of the Friedrich-Schiller-Universität Jena.
From 1982 till 1989 he was a scientific researcher  at the Academy of Sciences in Berlin (East): at the Cental Institute of Cybernetics and Information Processes and at the Karl-Weierstraß-Institute of Mathematics.
In 1989 he was Associate Professor for Algebra at the Technical University Otto-von-Guericke Magdeburg.
In the years 1990 till 1995 he was visiting professor at the RWTH Aachen, the universities Dortmund, Siegen, Cottbus and again at the RWTH Aachen, and was a guest professor at the TU Wien.
Since April 1, 1995 he is full professor for Theoretical Computer Science at the Martin-Luther-Universität Halle-Wittenberg.
From September 2000 till August 2006 he was the head of the Department for Mathematics and Computer Scinece.

Dr. Staiger`s Erdös number    is 2.

Dr. Staiger is external researcher of the CDMTCS.

He is a member of the Editorial Board of the Journal of Automata, Languages and Combinatorics    and of the managing commmittee of the Georg Cantor Association.


Talk at CIAA 2018   
"23rd International Conference on Implementation and Application of Automata

Charlottetown, July 30-August 2 2018
(jointly with Birzhan Moldagaliyev und Frank Stephan   )

Invited speaker at DCFS 2018   
"20th International Conference on Descriptional Complexity of Formal Systems"
Halifax, July 25-27 2018

Speaker at "Mathematics for Computation   "
Benediktinerabtei Niederaltaich St. Mauritius, Niederalteich, May 8 - 13, 2016

Talk in the Research Seminar    of the research programme "Quantitative Logics and Automata   "
Leipzig, Dezember 1, 2015

Talk (presented by  Rudi Freund   , further co-author Sergiu Ivanov)
at "Unconventional Computation & Natural Computation   "
Auckland, August 31 - September 4, 2015

Talk (presented by  Stefan Hoffmann   ) at
"20th International Conference
Implementation and Application of Automata   
Umeå, Sweden, August 18 - 21, 2015

Speaker at "Varieties of Algorithmic Information   "
Heidelberg, June 15 - 18, 2015

Invited speaker at AutoMathA 2015   
"Jewels of Automata: from Mathematics to Applications"
Leipzig, May 6 - 9, 2015


Some publications

Ronny Polley und Ludwig Staiger,
Quasiperiods, Subword Complexity and Pisot Numbers   .
15th Mons Theoretical Computer Science Days,
23-26 September 2014 Nancy (France)

Ludwig Staiger, Two theorems on the Hausdorff measure of
regular ω-languages.
in:  Logic, Computation, Hierarchies, (Vasco Brattka, Hannes Diener
and Dieter Spreen Eds.), Series: Ontos Mathematical Logic, Vol. 4,
de~Gruyter, Boston, Mass. 2014,  383 - 392.

Christian S. Calude, Ludwig Staiger and Frank Stephan,
Finite State Incompressible Infinite Sequences.
in: Theory and Applications of Models of Computation, (T. V. Gopal, Manindra Agrawal, Angsheng Li and S. Barry Cooper, Eds.)
Lecture Notes in Comput. Sci. No. 7318,
Springer-Verlag, Heidelberg 2014, 50 - 66.

Helmut Jürgensen and Ludwig Staiger,
Fault-tolerant acceptors for solid codes.
Presented at the 14th Mons days on Theoretical Computer Science,
Université catholique de Louvain, Belgium, September 11 - 14, 2012

Ludwig Staiger,
Asymptotic subword complexity,
in: Languages Alive, Essays dedicated to Jürgen Dassow
on the Occasion of His 65th Birthday, (Henning Bordihn, Martin Kutrib
and Bianca Truthe Eds.) Lecture Notes inComput. Sci. No. 7300,
Springer-Verlag, Heidelberg 2012, 236 - 245.

Ludwig Staiger,
A correspondence principle for exact constructive dimension,
in: How the World Computes - Turing Centenary Conference and
8th Conference on Computability in Europe, (S. Barry Cooper, Anuj Dawar
and Benedikt Löwe Eds.) Lecture Notes inComput. Sci. No. 7318,
Heidelberg 2012, 686 - 695.

Ludwig Staiger,
Oscillation-free Chaitin h-random sequences,
in: Computation, Physics and Beyond - International Workshop
on Theoretical Computer Science, (Michael J. Dinneen, Bakhadyr
Khoussainov and André Nies Eds.)  Lecture Notes in Comput. Sci.
7160, Springer-Verlag, Heidelberg 2012, 194 - 202.

Ludwig Staiger,
Constructive dimension and Hausdorff dimension: The
case of exact dimension,
in: Fundamentals of Computation Theory,
(O. Owe, M. Steffen and A. Telle Eds.)  Lecture Notes in
Comput. Sci. No. 6914, Springer-Verlag, Heidelberg 2011, 252 - 263.

Ludwig Staiger,
From error-correcting codes to algorithmic information theory,
in: Randomness Through Computation: Some Answers, More Questions (H. Zenil Ed.), World Scientific, Singapore 2011, 293 - 296.

Christian S. Calude, André Nies, Ludwig Staiger and Frank Stephan,
Universal Recursively Enumerable Sets of Strings,
Theoret. Comput. Sci. 412 (2011), 2253 – 2261.

Ludwig Staiger, Joint Topologies for Finite and Infinite Words,
in: Developments in Language Theory, (Yuan Gao, Hanlin Lu, Shinnosuke
Seki and Sheng Yu Eds.), Lecture Notes in
Comput. Sci. No. 6224, Springer-Verlag, Berlin 2010, 442 - 443.

Sibylle Schwarz and Ludwig Staiger
Topologies refining the Cantor topology on Xω,
in: Theoretical Computer Science (Cristian S. Calude et al. Eds.), IFIP Advances in  Information and Communication Technology Vol. 323, Springer-Verlag, Berlin 2010, 271 - 285,

Ronny Polley and Ludwig Staiger,
The maximal subword complexity of quasiperiodic infinite words,   
in: Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, (I. McQuillan and G. Pighizzini Eds.),  Electronic Proceedings in Theoretical Computer Science, Vol.~31 (2010), 169 - 176.

Ludwig Staiger and Klaus Wagner,
There are 49 Kuratowski Lattices,   
in: 'Programs, Proofs, Processes', (F. Ferreira, H. Guera,   E. Mayordomo
and L. Rasga Eds.), Proc. 6th Conf. CiE 2010, Abstract and Handout Booklet,
Univ. of the Acores, Ponta Delgada 2010, 357 - 368.

Jöran Mielke and Ludwig Staiger,
On Oscillation-free ε-random Sequences II,   
Proc. 6th International Conf. Computability and
Complexity in Analysis (CCA 2009), (A. Bauer, P. Hertling
and Ker-I Ko Eds.),
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany