Ludwig Staiger

RAIRO Theor. Informatics Appl., 2024

2023

Frontiers of Computability, Randomness, and Complexity (dedicated to the 70th birthday of Professor Cristian Calude).

[BibT_eX]

[DOI]

Theor. Comput. Sci., March, 2023

2021

Automata for solid codes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Bi-immunity over different size alphabets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

The Maximal Complexity of Quasiperiodic Infinite Words.

[BibT_eX]

[DOI]

Axioms, 2021

2020

On the incomputability of computable dimension.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2020

On the Generative Power of Quasiperiods.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2020

2019

Turing machines with activations of transitions.

[BibT_eX]

Proceedings of the Eleventh Workshop on Non-Classical Models of Automata and Applications, 2019

2018

Liouville, Computable, Borel Normal and Martin-Löf Random Numbers.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

A Simple Construction of Absolutely Disjunctive Liouville Numbers.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2018

On the Values for Factor Complexity.

[BibT_eX]

[DOI]

Birzhan Moldagaliyev

Frank Stephan

Proceedings of the Implementation and Application of Automata, 2018

Finite Automata and Randomness.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2018

2017

Shift-invariant topologies for the Cantor space Xω.

[BibT_eX]

[DOI]

Stefan Hoffmann

Sibylle Schwarz

Theor. Comput. Sci., 2017

2016

Quasiperiods, Subword Complexity and the Smallest Pisot Number.

[BibT_eX]

[DOI]

Ronney Polley

J. Autom. Lang. Comb., 2016

Going Beyond Turing with P Automata: Regular Observer ω-Languages and Partial Adult Halting.

[BibT_eX]

[DOI]

Sergiu Ivanov

Int. J. Unconv. Comput., 2016

Finite state incompressible infinite sequences.

[BibT_eX]

[DOI]

Frank Stephan

Inf. Comput., 2016

Exact constructive and computable dimensions.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2016

Bounds on the Kolmogorov complexity function for infinite words.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2016

2015

On the Hausdorff measure of regular ω-languages in Cantor space.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2015

Subword Metrics for Infinite Words.

[BibT_eX]

[DOI]

Stefan Hoffmann

Proceedings of the Implementation and Application of Automata, 2015

Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer ω-Languages.

[BibT_eX]

[DOI]

Sergiu Ivanov

Proceedings of the Unconventional Computation and Natural Computation, 2015

2014

Two Theorems on the Hausdorff Measure of Regular ω-Languages.

[BibT_eX]

[DOI]

Proceedings of the Logic, Computation, Hierarchies, 2014

2012

A Correspondence Principle for Exact Constructive Dimension.

[BibT_eX]

[DOI]

Proceedings of the How the World Computes, 2012

Asymptotic Subword Complexity.

[BibT_eX]

[DOI]

Proceedings of the Languages Alive, 2012

On Oscillation-Free Chaitin h-Random Sequences.

[BibT_eX]

[DOI]

Proceedings of the Computation, Physics and Beyond, 2012

2011

Universal recursively enumerable sets of strings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Oscillation-free Chaitin h-random sequences.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

Exact constructive dimension.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

Constructive Dimension and Hausdorff Dimension: The Case of Exact Dimension.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010

A note on accelerated Turing machines.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2010

The Maximal Subword Complexity of Quasiperiodic Infinite Words

[BibT_eX]

[DOI]

Ronny Polley

Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Topologies Refining the Cantor Topology on Xomega.

[BibT_eX]

[DOI]

Sibylle Schwarz

Proceedings of the Theoretical Computer Science, 2010

Joint Topologies for Finite and Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009

Topology on words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On universal computably enumerable prefix codes.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2009

On Oscillation-free epsilon-random Sequences II.

[BibT_eX]

[DOI]

Jöran Mielke

Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

2008

On Oscillation-free epsilon-random Sequences.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

2007

The Kolmogorov complexity of infinite words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Finite automata encoding geometric figures.

[BibT_eX]

[DOI]

Hideki Yamasaki

Theor. Comput. Sci., 2007

Decidability of code properties.

[BibT_eX]

[DOI]

Klaus Reinhardt

RAIRO Theor. Informatics Appl., 2007

Prefix-Free Lukasiewicz Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

On Maximal Prefix Codes.

[BibT_eX]

Bull. EATCS, 2007

2006

On partial randomness.

[BibT_eX]

[DOI]

Sebastiaan Terwijn

Ann. Pure Appl. Log., 2006

2005

Generalisations of disjunctive sequences.

[BibT_eX]

[DOI]

Math. Log. Q., 2005

Hausdorff Measure and Lukasiewicz Languages.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2005

The entropy of Lukasiewicz-languages.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2005

Constructive dimension equals Kolmogorov complexity.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Infinite iterated function systems in cantor space and the hausdorff measure of omega-power languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Deterministic Complexity and Entropy.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2005

Topologies for the Set of Disjunctive oemga-words

[BibT_eX]

[DOI]

Acta Cybern., 2005

The Kolmogorov complexity of infinite objects.

[BibT_eX]

Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2004

Preface.

[BibT_eX]

[DOI]

Vasco Brattka

Klaus Weihrauch

Proceedings of the 6th Workshop on Computability and Complexity in Analysis, 2004

On the Hausdorff Measure of omega-Power Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 2004

2003

Weighted Finite Automata and Metrics in Cantor Space.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2003

A topological characterization of random sequences.

[BibT_eX]

[DOI]

Cristian Calude

Solomon Marcus

Inf. Process. Lett., 2003

omega-P Automata with Communication Rules.

[BibT_eX]

[DOI]

Marion Oswald

Proceedings of the Membrane Computing, International Workshop, 2003

2002

The Kolmogorov complexity of real numbers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

How Large is the Set of Disjunctive Sequences?

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2002

A Simple Example of an omega-Language Topologically.

[BibT_eX]

Hideki Yamasaki

Bull. EATCS, 2002

2001

Iterated Function Systems and Control Languages.

[BibT_eX]

[DOI]

Inf. Comput., 2001

Topologies for the Set of Disjunctive omega-Words.

[BibT_eX]

Proceedings of the Words, Semigroups, and Transductions, 2001

Acceptance of omega-languages by communicating deterministic turing maching.

[BibT_eX]

Proceedings of the Where Mathematics, 2001

2000

On the Power of Reading the Whole Infinite Input Tape.

[BibT_eX]

[DOI]

Proceedings of the Finite Versus Infinite, 2000

1999

On the Power of Reading the Whole Infinite Input Tape.

[BibT_eX]

[DOI]

Grammars, 1999

Finite Automata Encoding Geometric Figures.

[BibT_eX]

[DOI]

Proceedings of the Automata Implementation, 1999

1998

A. Tight Upper Bound on Kolmogorov Complexity and Uniformly Optimal Prediction.

[BibT_eX]

[DOI]

Theory Comput. Syst., 1998

The Hausdorff Measure of Regular omega-languages is Computable.

[BibT_eX]

Bull. EATCS, 1998

IFS and Control Languages.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

ω-Languages.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Formal Languages, Volume 3: Beyond Words., 1997

On Syntactic Congruences for Omega-Languages.

[BibT_eX]

[DOI]

Oded Maler

Theor. Comput. Sci., 1997

Finite Acceptance of Infinite Words.

[BibT_eX]

[DOI]

Igor Litovsky

Theor. Comput. Sci., 1997

Rich omega-Words and Monadic Second-Order Arithmetic.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 11th International Workshop, 1997

On omega-power Languages.

[BibT_eX]

[DOI]

Proceedings of the New Trends in Formal Languages, 1997

1996

Codes, Simplifying Words, and Open Set Condition.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

1995

Local Hausdorff Dimension.

[BibT_eX]

[DOI]

Acta Informatica, 1995

1994

Fractals, Dimension, and Formal Languages.

[BibT_eX]

[DOI]

Wolfgang Merzenich

RAIRO Theor. Informatics Appl., 1994

Codes and Infinite Words.

[BibT_eX]

[DOI]

Acta Cybern., 1994

Valuations and Unambiguity of Languages, with Applications to Fractal Geometry.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993

Kolgomorov Complexity and Hausdorff Dimension

[BibT_eX]

[DOI]

Inf. Comput., April, 1993

Recursive Automata on Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the STACS 93, 1993

1991

On Codes having Dual Distance d'>=k.

[BibT_eX]

J. Inf. Process. Cybern., 1991

1989

On the weight distribution of linear codes having dual distance d' geq k.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1989

Kolmogorov Complexity and Hausdorff Dimension.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1989

1988

Ein Satz über die Entropie von Untermonoiden (A Theorem on the Entropy of Submonoids).

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

1987

Sequential Mappings of omega-Languages.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1987

Why are Serial Convolutional Encoders Catastrophic?

[BibT_eX]

J. Inf. Process. Cybern., 1987

Research in the Theory of omega-languages.

[BibT_eX]

J. Inf. Process. Cybern., 1987

1986

On Infinitary Finite Length Codes.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1986

Hierarchies of Recursive omega-languages.

[BibT_eX]

J. Inf. Process. Cybern., 1986

The Centers of Context-Sensitive Languages.

[BibT_eX]

[DOI]

Werner Nehrlich

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985

Representable P. Martin-Löf tests.

[BibT_eX]

[DOI]

Kybernetika, 1985

1984

Projection Lemmas for omega-Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1984

1983

Finite-State omega-Languages.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1983

Subspaces of GF(q)^w and Convolutional Codes

[BibT_eX]

[DOI]

Inf. Control., 1983

1981

Complexity and Entropy.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980

A Note on Connected omega-Languages.

[BibT_eX]

J. Inf. Process. Cybern., 1980

1978

Rekursive Folgenmengen I.

[BibT_eX]

[DOI]

Math. Log. Q., 1978

1977

Erkennungs-, Masz- Und Informationstheoretische Eigenschaften Regulärer Folgenmengen.

[BibT_eX]

[DOI]

Rolf Lindner

Math. Log. Q., 1977

Recursive omega-Languages.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1977

Empty - Storage - Acceptance of omega-Languages.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1977

1976

Reguläre Nullmengen.

[BibT_eX]

J. Inf. Process. Cybern., 1976

1975

Quasilineare Automaten und die von ihnen realisierten Operatoren.

[BibT_eX]

J. Inf. Process. Cybern., 1975

1974

Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen.

[BibT_eX]

J. Inf. Process. Cybern., 1974

Eine Bemerkung über nichtkonstantenfreie sequentielle Operatoren.

[BibT_eX]

Rolf Lindner

J. Inf. Process. Cybern., 1974

Finite Automata Acceptation of Infinite Sequences.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science, 1974

1972

Eine Bemerkung zur Charakterisierung von Folgenmengen durch Wortmengen.

[BibT_eX]

J. Inf. Process. Cybern., 1972

Über die Entscheidung und Aufzählung regulärer Wortmengen durch Markowsche Algorithmen.

[BibT_eX]

Dorothee Arold

Lutz Bernhardt