Ludwig Staiger
#57,648
Most Influential Person Now
German mathematician and computer scientist
Ludwig Staiger's AcademicInfluence.com Rankings
Ludwig Staigercomputer-science Degrees
Computer Science
#2528
World Rank
#2640
Historical Rank
Theoretical Computer Science
#47
World Rank
#47
Historical Rank
Ludwig Staigermathematics Degrees
Mathematics
#4809
World Rank
#6802
Historical Rank
Group Theory
#229
World Rank
#270
Historical Rank
Algebra
#569
World Rank
#751
Historical Rank
Measure Theory
#3248
World Rank
#3840
Historical Rank
Download Badge
Computer Science Mathematics
Why Is Ludwig Staiger Influential?
(Suggest an Edit or Addition)According to Wikipedia, 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; Staiger wrote his doctoral thesis, Zur Topologie der regulären Mengen, under the direction of and Rolf Lindner.
Ludwig Staiger's Published Works
Published Works
- Languages (1997) (549)
- Kolmogorov Complexity and Hausdorff Dimension (1989) (114)
- A Tight Upper Bound on Kolmogorov Complexity and Uniformly Optimal Prediction (1998) (89)
- On partial randomness (2006) (69)
- On Syntactic Congruences for Omega-Languages (1993) (67)
- Research in the theory of Ω-languages (1987) (56)
- Finite-State omega-Languages (1983) (55)
- The Kolmogorov complexity of real numbers (1999) (51)
- Constructive dimension equals Kolmogorov complexity (2005) (45)
- Topology on words (2009) (44)
- Deterministic Complexity and Entropy (2004) (38)
- Hierarchies of Recursive omega-languages (1986) (38)
- On Infinitary Finite Length Codes (1986) (36)
- Kolgomorov Complexity and Hausdorff Dimension (1993) (31)
- Codes and Infinite Words (1994) (30)
- Fractals, Dimension, and Formal Languages (1993) (30)
- The Kolmogorov complexity of infinite words (2007) (27)
- Rich omega-Words and Monadic Second-Order Arithmetic (1997) (25)
- A topological characterization of random sequences (2003) (24)
- Valuations and Unambiguity of Languages, with Applications to Fractal Geometry (1994) (23)
- COMBINATORIAL PROPERTIES OF THE HAUSDORFF DIMENSION (1989) (23)
- A note on accelerated Turing machines (2010) (22)
- Finite Acceptance of Infinite Words (1997) (22)
- Sequential Mappings of omega-Languages (1987) (21)
- On !-power languages (2007) (20)
- Recursive Automata on Infinite Words (1993) (19)
- Iterated Function Systems and Control Languages (2001) (18)
- On the Power of Reading the Whole Infinite Input Tape (1999) (16)
- Recursive omega-Languages (1977) (16)
- How Large is the Set of Disjunctive Sequences? (2002) (15)
- omega-P Automata with Communication Rules (2003) (15)
- Local Hausdorff dimension (1995) (15)
- Infinite iterated function systems in cantor space and the hausdorff measure of omega-power languages (2005) (14)
- On omega-power Languages (1997) (14)
- Codes, Simplifying Words, and Open Set Condition (1996) (13)
- Subspaces of GF(q)^w and Convolutional Codes (1983) (13)
- Finite automata encoding geometric figures (1999) (13)
- Decidability of code properties (2000) (12)
- Finite state incompressible infinite sequences (2014) (12)
- Complexity and Entropy (1981) (12)
- Disjunctive Sequences: An Overview (1997) (12)
- On universal computably enumerable prefix codes (2009) (12)
- On Oscillation-free ε-random Sequences (2008) (11)
- ω-P automata with communication rules (2004) (11)
- The Maximal Subword Complexity of Quasiperiodic Infinite Words (2010) (11)
- Universal recursively enumerable sets of strings (2008) (11)
- The entropy of Lukasiewicz-languages (2001) (10)
- Topologies for the set of disjunctive ω-words (2005) (9)
- How Much can You Win when Your Adversary is Handicapped (2000) (9)
- The Hausdorff Measure of Regular omega-languages is Computable (1998) (9)
- Reguläre Nullmengen (1976) (8)
- Topologies Refining the Cantor Topology on X ! (2010) (8)
- Weighted Finite Automata and Metrics in Cantor Space (2003) (8)
- Liouville, Computable, Borel Normal and Martin-Löf Random Numbers (2018) (7)
- Empty - Storage - Acceptance of omega-Languages (1977) (7)
- Generalisations of disjunctive sequences (2005) (7)
- Randomness relative to Cantor expansions (2003) (7)
- Constructive Dimension and Hausdorff Dimension: The Case of Exact Dimension (2011) (6)
- The Hausdor Measure of Regular � languages is Computable � (1998) (6)
- Acceptance of Ω-languages by communicating deterministic turing maching (2001) (6)
- Projection Lemmas for omega-Languages (1984) (6)
- On Maximal Prefix Codes (2006) (6)
- Asymptotic Subword Complexity (2012) (6)
- Exact Constructive and Computable Dimensions (2017) (5)
- Liouville Numbers, Borel Normality and Algorithmic Randomness (2013) (5)
- Ein Satz über die Entropie von Untermonoiden (A Theorem on the Entropy of Submonoids) (1988) (5)
- Numbers Defined by Turing Machines (1996) (5)
- On Oscillation-free ε-random Sequences II (2009) (4)
- The Kolmogorov Complexity of Liouville Numbers (1999) (4)
- Quasiperiods of Infinite Words (2017) (4)
- Subword Metrics for Infinite Words (2015) (4)
- Shift-invariant topologies for the Cantor space Xω (2017) (4)
- Bounds on the Kolmogorov complexity function for infinite words (2016) (3)
- The Centers of Context-Sensitive Languages (1996) (3)
- Topologies Refining the Cantor Topology on Xomega (2010) (3)
- Research in the Theory of omega-languages (1987) (3)
- Bi-immunity over different size alphabets (2021) (3)
- IFS and Control Languages (1998) (3)
- A Correspondence Principle for Exact Constructive Dimension (2012) (3)
- Sequential mappings of ω-languages (2018) (3)
- Sequential mappings of ω-languages (2018) (3)
- Quasiperiods, Subword Complexity and the Smallest Pisot Number (2016) (2)
- On the Values for Factor Complexity (2018) (2)
- On the square-root bound for QR-codes (1988) (2)
- Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer ω-Languages (2015) (2)
- Going Beyond Turing with P Automata: Regular Observer ω-Languages and Partial Adult Halting (2016) (2)
- On the Hausdorff measure of regular ω-languages in Cantor space (2015) (2)
- A Note on Connected omega-Languages (1980) (2)
- Numbers Deened by Turing Machines (1996) (1)
- Topologies for the Set of Disjunctive oemga-words (2005) (1)
- In the Cantor Space and the Baire Space, G[delta]\F[sigma] is a Single Wadge-Degree, an effective proof (1992) (1)
- On Oscillation-Free Chaitin h-Random Sequences (2012) (1)
- Hausdorff Measure and Lukasiewicz Languages (2005) (1)
- Two Theorems on the Hausdorff Measure of Regular ω-Languages (2014) (1)
- On the weight distribution of linear codes having dual distance d' geq k (1989) (1)
- On the Generative Power of Quasiperiods (2020) (1)
- Representable P. Martin-Löf tests (1985) (1)
- Joint Topologies for Finite and Infinite Words (2010) (1)
- Liouville, Computable, Borel Normal and Martin-Löf Random Numbers (2017) (1)
- Series Universal Recursively Enumerable Sets of Strings (2009) (1)
- Finite Automata and Randomness (2018) (1)
- On the Hausdorff measure of ω-power languages (2004) (0)
- On the incomputability of computable dimension (2019) (0)
- On Oscillation-free epsilon-random Sequences (2008) (0)
- Series A Note on Accelerated Turing Machines (2009) (0)
- Finite Automata Acceptation of Infinite Sequences (1974) (0)
- Series Exact Constructive and Computable Dimensions (2016) (0)
- Acceptance of omega-languages by communicating deterministic turing maching (2001) (0)
- On the Hausdorff Measure of omega-Power Languages (2004) (0)
- Principle for Exact Constructive Dimension (2012) (0)
- Topologies for Finite Words: Compatibility with the C ANTOR Topology (2022) (0)
- Normality and Algorithmic Randomness (2013) (0)
- Exact constructive dimension (2011) (0)
- Series On Oscillation-free ε-random Sequences II (2009) (0)
- On Codes having Dual Distance d'>=k (1991) (0)
- Why are Serial Convolutional Encoders Catastrophic? (1987) (0)
- Exact Constructive and Computable Dimensions (2017) (0)
- A Simple Example of an omega-Language Topologically (2002) (0)
- Frontiers of Computability, Randomness, and Complexity (dedicated to the 70th birthday of Professor Cristian Calude) (2023) (0)
- Series Constructive Dimension equals Kolmogorov Complexity (2003) (0)
- Series On Oscillation-free ε-random Sequences (2008) (0)
- CDMTCS Research Report Series On Partial Randomness (2004) (0)
- The Kolmogorov complexity of infinite objects (2005) (0)
- On the Computation of Hausdorff Dimension and its Relation to Channel Capacity (1988) (0)
- Prefix-Free Lukasiewicz Languages (2007) (0)
- Automata for solid codes (2021) (0)
- The Maximal Complexity of Quasiperiodic Infinite Words (2021) (0)
- From Error-correcting Codes to Algorithmic Information Theory (2011) (0)
- Series Generalisations of Disjunctive Sequences (2004) (0)
- Normality and Martin-Löf Randomness (2016) (0)
- CDMTCS Research Report Series Universal Recursively Enumerable Sets of Strings (0)
- Preface (2004) (0)
- Cdmtcs Research Report Series the Hausdorr Measure of Regular !-languages Is Computable 1 (1998) (0)
- On Oscillation-free epsilon-random Sequences II (2009) (0)
- Research Report Series Topology on Words (2008) (0)
- On Domains of Universal Machines (2009) (0)
- Turing machines with activations of transitions (2019) (0)
- Series On Universal Computably Enumerable Prefix Codes (2007) (0)
- Valuation Entropy of !-languages & Ifs (2007) (0)
- How to Go Beyond Turing with P Automata: Time Travels, Regular Observer !-Languages, and Partial Adult Halting (2015) (0)
- A Simple Construction of Absolutely Disjunctive Liouville Numbers (2018) (0)
- Series On the incomputability of computable dimension (2019) (0)
This paper list is powered by the following services:
Other Resources About Ludwig Staiger
What Schools Are Affiliated With Ludwig Staiger?
Ludwig Staiger is affiliated with the following schools: