Ludwig Staiger

ORCID

Publication Activity (10 Years)

Years Active: 1972-2024
Publications (10 Years): 20

Top Venues

Theor. Comput. Sci.

J. Autom. Lang. Comb.

CIAA

Theory Comput. Syst.

Publications

Ludwig Staiger
Topologies for Finite Words: Compatibility with the Cantor Topology. RAIRO Theor. Informatics Appl. 58 (2024)
Alastair A. Abbott, Cezar Câmpeanu, Ludwig Staiger, Marius Zimand, Arto Salomaa
Frontiers of Computability, Randomness, and Complexity (dedicated to the 70th birthday of Professor Cristian Calude). Theor. Comput. Sci. 952 (2023)
Cristian S. Calude, Karen Frilya Celine, Ziyuan Gao, Sanjay Jain, Ludwig Staiger, Frank Stephan
Bi-immunity over different size alphabets. Theor. Comput. Sci. 894 (2021)
Helmut Jürgensen, Ludwig Staiger
Automata for solid codes. Theor. Comput. Sci. 892 (2021)
Ludwig Staiger
The Maximal Complexity of Quasiperiodic Infinite Words. Axioms 10 (4) (2021)
Ludwig Staiger
On the incomputability of computable dimension. Log. Methods Comput. Sci. 16 (2) (2020)
Ludwig Staiger
On the Generative Power of Quasiperiods. DCFS (2020)
Ludwig Staiger
On the incomputability of computable dimension. CoRR (2019)
Rudolf Freund, Ludwig Staiger
Turing machines with activations of transitions. NCMA (2019)
Ludwig Staiger
Finite Automata and Randomness. DCFS (2018)
Cristian S. Calude, Ludwig Staiger
A Simple Construction of Absolutely Disjunctive Liouville Numbers. J. Autom. Lang. Comb. 23 (1-3) (2018)
Birzhan Moldagaliyev, Ludwig Staiger, Frank Stephan
On the Values for Factor Complexity. CIAA (2018)
Cristian S. Calude, Ludwig Staiger
Liouville, Computable, Borel Normal and Martin-Löf Random Numbers. Theory Comput. Syst. 62 (7) (2018)
Stefan Hoffmann, Sibylle Schwarz, Ludwig Staiger
. Theor. Comput. Sci. 679 (2017)
Ludwig Staiger
Exact Constructive and Computable Dimensions. Theory Comput. Syst. 61 (4) (2017)
Ronney Polley, Ludwig Staiger
Quasiperiods, Subword Complexity and the Smallest Pisot Number. J. Autom. Lang. Comb. 21 (1-2) (2016)
Cristian S. Calude, Ludwig Staiger, Frank Stephan
Finite state incompressible infinite sequences. Inf. Comput. 247 (2016)
Ludwig Staiger
Bounds on the Kolmogorov complexity function for infinite words. Electron. Colloquium Comput. Complex. 23 (2016)
Rudolf Freund, Sergiu Ivanov, Ludwig Staiger
Going Beyond Turing with P Automata: Regular Observer ω-Languages and Partial Adult Halting. Int. J. Unconv. Comput. 12 (1) (2016)
Ludwig Staiger
Exact constructive and computable dimensions. Electron. Colloquium Comput. Complex. 23 (2016)
Ludwig Staiger
On the Hausdorff measure of regular ω-languages in Cantor space. Discret. Math. Theor. Comput. Sci. 17 (1) (2015)
Rudolf Freund, Sergiu Ivanov, Ludwig Staiger
Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer ω-Languages. UCNC (2015)
Stefan Hoffmann, Ludwig Staiger
Subword Metrics for Infinite Words. CIAA (2015)
Cristian S. Calude, Ludwig Staiger, Frank Stephan
Finite State Incompressible Infinite Sequences. TAMC (2014)
Ludwig Staiger
On Oscillation-Free Chaitin h-Random Sequences. Computation, Physics and Beyond (2012)
Ludwig Staiger
A Correspondence Principle for Exact Constructive Dimension. CiE (2012)
Ludwig Staiger
Asymptotic Subword Complexity. Languages Alive (2012)
Ludwig Staiger
Constructive Dimension and Hausdorff Dimension: The Case of Exact Dimension. FCT (2011)
Ludwig Staiger
Exact constructive dimension. Electron. Colloquium Comput. Complex. 18 (2011)
Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan
Universal recursively enumerable sets of strings. Theor. Comput. Sci. 412 (22) (2011)
Ludwig Staiger
-random sequences. Electron. Colloquium Comput. Complex. 18 (2011)
Ronny Polley, Ludwig Staiger
The Maximal Subword Complexity of Quasiperiodic Infinite Words DCFS (2010)
Ludwig Staiger
Joint Topologies for Finite and Infinite Words. Developments in Language Theory (2010)
Cristian S. Calude, Ludwig Staiger
A note on accelerated Turing machines. Math. Struct. Comput. Sci. 20 (6) (2010)
Sibylle Schwarz, Ludwig Staiger
. IFIP TCS (2010)
Cristian S. Calude, Ludwig Staiger
On universal computably enumerable prefix codes. Math. Struct. Comput. Sci. 19 (1) (2009)
Cristian S. Calude, Helmut Jürgensen, Ludwig Staiger
Topology on words. Theor. Comput. Sci. 410 (24-25) (2009)
Jöran Mielke, Ludwig Staiger
On Oscillation-free epsilon-random Sequences II. CCA (2009)
Ludwig Staiger
On Oscillation-free epsilon-random Sequences. Electron. Notes Theor. Comput. Sci. 221 (2008)
Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan
Universal Recursively Enumerable Sets of Strings. Developments in Language Theory (2008)
Henning Fernau, Klaus Reinhardt, Ludwig Staiger
Decidability of code properties. RAIRO Theor. Informatics Appl. 41 (3) (2007)
Helmut Jürgensen, Ludwig Staiger, Hideki Yamasaki
Finite automata encoding geometric figures. Theor. Comput. Sci. 381 (1-3) (2007)
Ludwig Staiger
On Maximal Prefix Codes. Bull. EATCS 91 (2007)
Ludwig Staiger
The Kolmogorov complexity of infinite words. Theor. Comput. Sci. 383 (2-3) (2007)
Ludwig Staiger
Prefix-Free Lukasiewicz Languages. Int. J. Found. Comput. Sci. 18 (6) (2007)
Ludwig Staiger
The Kolmogorov complexity of infinite words. Electron. Colloquium Comput. Complex. 13 (070) (2006)
Cristian S. Calude, Ludwig Staiger, Sebastiaan Terwijn
On partial randomness. Ann. Pure Appl. Log. 138 (1-3) (2006)
Ludwig Staiger
Topologies for the Set of Disjunctive oemga-words Acta Cybern. 17 (1) (2005)
Vasco Brattka, Ludwig Staiger, Klaus Weihrauch
Preface. Electron. Notes Theor. Comput. Sci. 120 (2005)
Ludwig Staiger
Infinite iterated function systems in cantor space and the hausdorff measure of omega-power languages. Int. J. Found. Comput. Sci. 16 (4) (2005)
Mark R. Titchener, Radu Nicolescu, Ludwig Staiger, T. Aaron Gulliver, Ulrich Speidel
Deterministic Complexity and Entropy. Fundam. Informaticae 64 (1-4) (2005)
Cristian S. Calude, Ludwig Staiger
Generalisations of disjunctive sequences. Math. Log. Q. 51 (2) (2005)
Ludwig Staiger
The Kolmogorov complexity of infinite objects. DCFS (2005)
Ludwig Staiger
The entropy of Lukasiewicz-languages. RAIRO Theor. Informatics Appl. 39 (4) (2005)
Ludwig Staiger
Constructive dimension equals Kolmogorov complexity. Inf. Process. Lett. 93 (3) (2005)
Ludwig Staiger
Hausdorff Measure and Lukasiewicz Languages. J. Univers. Comput. Sci. 11 (12) (2005)
Ludwig Staiger
On the Hausdorff Measure of omega-Power Languages. Developments in Language Theory (2004)
Ludwig Staiger
Weighted Finite Automata and Metrics in Cantor Space. J. Autom. Lang. Comb. 8 (2) (2003)
Cristian Calude, Solomon Marcus, Ludwig Staiger
A topological characterization of random sequences. Inf. Process. Lett. 88 (5) (2003)
Rudolf Freund, Marion Oswald, Ludwig Staiger
omega-P Automata with Communication Rules. Workshop on Membrane Computing (2003)
Ludwig Staiger
How Large is the Set of Disjunctive Sequences? J. Univers. Comput. Sci. 8 (2) (2002)
Ludwig Staiger
The Kolmogorov complexity of real numbers. Theor. Comput. Sci. 284 (2) (2002)
Ludwig Staiger, Hideki Yamasaki
A Simple Example of an omega-Language Topologically. Bull. EATCS 78 (2002)
Ludwig Staiger
The Entropy of Lukasiewicz-Languages. Developments in Language Theory (2001)
Ludwig Staiger
How Large is the Set of Disjunctive Sequences? DMTCS (2001)
Ludwig Staiger
Topologies for the Set of Disjunctive omega-Words. Words, Semigroups, and Transductions (2001)
Rudolf Freund, Ludwig Staiger
Acceptance of omega-languages by communicating deterministic turing maching. Where Mathematics, Computer Science, Linguistics and Biology Meet (2001)
Henning Fernau, Ludwig Staiger
Iterated Function Systems and Control Languages. Inf. Comput. 168 (2) (2001)
Helmut Jürgensen, Ludwig Staiger
Finite Automata Encoding Geometric Figures. WIA (1999)
Ludwig Staiger
On the Power of Reading the Whole Infinite Input Tape. Grammars 2 (3) (1999)
Henning Fernau, Klaus Reinhardt, Ludwig Staiger
Decidability of code properties. Developments in Language Theory (1999)
Ludwig Staiger
The Kolmogorov Complexity of Real Numbers. FCT (1999)
Ludwig Staiger
The Hausdorff Measure of Regular omega-languages is Computable. Bull. EATCS 66 (1998)
Ludwig Staiger
A. Tight Upper Bound on Kolmogorov Complexity and Uniformly Optimal Prediction. Theory Comput. Syst. 31 (3) (1998)
Henning Fernau, Ludwig Staiger
IFS and Control Languages. MFCS (1998)
Ludwig Staiger
Rich omega-Words and Monadic Second-Order Arithmetic. CSL (1997)
Igor Litovsky, Ludwig Staiger
Finite Acceptance of Infinite Words. Theor. Comput. Sci. 174 (1-2) (1997)
Oded Maler, Ludwig Staiger
On Syntactic Congruences for Omega-Languages. Theor. Comput. Sci. 183 (1) (1997)
Ludwig Staiger
On omega-power Languages. New Trends in Formal Languages (1997)
Ludwig Staiger
Codes, Simplifying Words, and Open Set Condition. Inf. Process. Lett. 58 (6) (1996)
Igor Litovsky, Ludwig Staiger
Finite Acceptance of Infinite Words. Developments in Language Theory (1995)
Helmut Jürgensen, Ludwig Staiger
Local Hausdorff Dimension. Acta Informatica 32 (5) (1995)
Jeanne Devolder, Michel Latteux, Igor Litovsky, Ludwig Staiger
Codes and Infinite Words. Acta Cybern. 11 (4) (1994)
Wolfgang Merzenich, Ludwig Staiger
Fractals, Dimension, and Formal Languages. RAIRO Theor. Informatics Appl. 28 (3-4) (1994)
Henning Fernau, Ludwig Staiger
Valuations and Unambiguity of Languages, with Applications to Fractal Geometry. ICALP (1994)
Wolfgang Merzenich, Ludwig Staiger
Fractals, Dimension, and Formal Languages. Developments in Language Theory (1993)
Ludwig Staiger
Kolgomorov Complexity and Hausdorff Dimension Inf. Comput. 103 (2) (1993)
Oded Maler, Ludwig Staiger
On Syntactic Congruences for Omega-Languages. STACS (1993)
Ludwig Staiger
Recursive Automata on Infinite Words. STACS (1993)
Ludwig Staiger
On Codes having Dual Distance d'>=k. J. Inf. Process. Cybern. 27 (7) (1991)
Ludwig Staiger
Kolmogorov Complexity and Hausdorff Dimension. FCT (1989)
Ludwig Staiger
On the weight distribution of linear codes having dual distance d' geq k. IEEE Trans. Inf. Theory 35 (1) (1989)
Ludwig Staiger
Ein Satz über die Entropie von Untermonoiden (A Theorem on the Entropy of Submonoids). Theor. Comput. Sci. 61 (1988)
Ludwig Staiger
Sequential Mappings of omega-Languages. RAIRO Theor. Informatics Appl. 21 (2) (1987)
Ludwig Staiger
Why are Serial Convolutional Encoders Catastrophic? J. Inf. Process. Cybern. 23 (12) (1987)
Ludwig Staiger
Research in the Theory of omega-languages. J. Inf. Process. Cybern. 23 (8/9) (1987)
Ludwig Staiger
On Infinitary Finite Length Codes. RAIRO Theor. Informatics Appl. 20 (4) (1986)
Ludwig Staiger
Hierarchies of Recursive omega-languages. J. Inf. Process. Cybern. 22 (5/6) (1986)
Ludwig Staiger, Werner Nehrlich
The Centers of Context-Sensitive Languages. MFCS (1986)
Ludwig Staiger
Representable P. Martin-Löf tests. Kybernetika 21 (3) (1985)

Ludwig Staiger.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ludwig Staiger