Ludwig Staiger
Ludwig Staiger is a German mathematician and computer scientist at the Martin Luther University of Halle-Wittenberg.
He received his Ph.D. in Mathematics from the University of Jena in 1976; his doctoral thesis, Zur Topologie der regulären Mengen, was written under the direction of Gerd Wechsung and Rolf Lindner.[1]
Previously he held positions at the Academy of Sciences in Berlin (East), the , the Karl Weierstrass Institute for Mathematics and the Technical University Otto-von-Guericke Magdeburg. He was a visiting professor at RWTH Aachen University, the universities Dortmund, Siegen, and Cottbus in Germany and the Technical University Vienna, Austria. He is a member of the Managing Committee of the and an external researcher of the Center for Discrete Mathematics and Theoretical Computer Science at the University of Auckland, New Zealand.[2]
He co-invented with Klaus Wagner the . Staiger is an expert in ω-languages, an area in which he wrote more than 19 papers [3] including the paper on this topic in the monograph.[4] He found surprising applications of ω-languages in the study of Liouville numbers.
Staiger is an active researcher in combinatorics on words, automata theory, effective dimension theory,[5] and algorithmic information theory.
Notes[]
- ^ Ludwig Staiger at the Mathematics Genealogy Project
- ^ CDMTCS External Researchers
- ^ Ludwig Staiger at DBLP Bibliography Server
- ^ Handbook of Formal Languages
- ^ ECCC Reports of Ludwig Staiger
Bibliography[]
- L. Staiger. Quasiperiods of infinite words. In Alexandra Bellow, Cristian S. Calude, , editors, Mathematics Almost Everywhere: In Memory of Solomon Marcus, pages 17-36, World Scientific, Singapore, 2018.
- C. S. Calude, L. Staiger. Liouville numbers, Borel normality and algorithmic randomness, Theory of Computing Systems, First online 27 April 2017, doi:10.1007/s00224-017-9767-8.
- Staiger, L. "Exact Constructive and Computable Dimensions", Theory of Computing Systems 61 (2017) 4, 1288-1314.
- C. S. Calude, L. Staiger, F. Stephan. Finite state incompressible infinite sequences, Information and Computation 247 (2016), 23-36.
- Staiger, L. "On Oscillation-Free Chaitin h-Random Sequences". In [M. Dinneen, B. Khoussainov and A. Nies, editors, Computation, Physics and Beyond, pages 194-202. Springer-Verlag, 2012.
- Staiger, L. The Kolmogorov complexity of infinite words, Electronic Colloquium on Computational Complexity (EECC) 13, 70 (2006).
- Staiger, L. "ω-Languages". In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, Volume 3, pages 339-387. Springer-Verlag, Berlin, 1997.
External links[]
- Ludwig Staiger Home Page
- CDMTCS at the University of Auckland
- Ludwig Staiger at DBLP Bibliography Server
- Ludwig Staiger publications indexed by Google Scholar
- Algorithmic Complexity and Applications: Special issue of Fundamenta Informaticae (83, 1-2, 2008), dedicated to Professor L. Staiger 60's birthday.
| hide Authority control  | |
|---|---|
| General | |
| National libraries | |
| Scientific databases | |
- Theory of computation
- Formal languages
- 21st-century German mathematicians
- Living people
- German computer scientists
- 20th-century German mathematicians
- University of Jena alumni
- Martin Luther University of Halle-Wittenberg faculty