dblp.uni-trier.dewww.uni-trier.de

Ludwig Staiger

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2009
70EECristian S. Calude, Ludwig Staiger: On universal computably enumerable prefix codes. Mathematical Structures in Computer Science 19(1): 45-57 (2009)
2008
69EECristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan: Universal Recursively Enumerable Sets of Strings. Developments in Language Theory 2008: 170-182
68EELudwig Staiger: On Oscillation-free epsilon-random Sequences. Electr. Notes Theor. Comput. Sci. 221: 287-297 (2008)
2007
67EELudwig Staiger: Prefix-Free Lukasiewicz Languages. Int. J. Found. Comput. Sci. 18(6): 1417-1423 (2007)
66EEHelmut Jürgensen, Ludwig Staiger, Hideki Yamasaki: Finite automata encoding geometric figures. Theor. Comput. Sci. 381(1-3): 33-43 (2007)
65EELudwig Staiger: The Kolmogorov complexity of infinite words. Theor. Comput. Sci. 383(2-3): 187-199 (2007)
2006
64EECristian S. Calude, Ludwig Staiger, Sebastiaan Terwijn: On partial randomness. Ann. Pure Appl. Logic 138(1-3): 20-30 (2006)
63EELudwig Staiger: The Kolmogorov complexity of infinite words. Electronic Colloquium on Computational Complexity (ECCC) 13(070): (2006)
2005
62EELudwig Staiger: Topologies for the Set of Disjunctive oemga-words Acta Cybern. 17(1): (2005)
61EEVasco Brattka, Ludwig Staiger, Klaus Weihrauch: Preface. Electr. Notes Theor. Comput. Sci. 120: 1- (2005)
60EEMark R. Titchener, Radu Nicolescu, Ludwig Staiger, T. Aaron Gulliver, Ulrich Speidel: Deterministic Complexity and Entropy. Fundam. Inform. 64(1-4): 443-461 (2005)
59EELudwig Staiger: Constructive dimension equals Kolmogorov complexity. Inf. Process. Lett. 93(3): 149-153 (2005)
58EELudwig Staiger: Infinite iterated function systems in cantor space and the hausdorff measure of omega-power languages. Int. J. Found. Comput. Sci. 16(4): 787-802 (2005)
57EELudwig Staiger: Hausdorff Measure and Lukasiewicz Languages. J. UCS 11(12): 2114-2124 (2005)
56EECristian S. Calude, Ludwig Staiger: Generalisations of disjunctive sequences. Math. Log. Q. 51(2): 120-128 (2005)
2004
55EELudwig Staiger: On the Hausdorff Measure of omega-Power Languages. Developments in Language Theory 2004: 393-405
2003
54EERudolf Freund, Marion Oswald, Ludwig Staiger: omega-P Automata with Communication Rules. Workshop on Membrane Computing 2003: 203-217
53EECristian Calude, Solomon Marcus, Ludwig Staiger: A topological characterization of random sequences. Inf. Process. Lett. 88(5): 245-250 (2003)
52 Ludwig Staiger: Weighted Finite Automata and Metrics in Cantor Space. Journal of Automata, Languages and Combinatorics 8(2): 353-360 (2003)
2002
51 Ludwig Staiger, Hideki Yamasaki: A Simple Example of an omega-Language Topologically. Bulletin of the EATCS 78: (2002)
50EELudwig Staiger: How Large is the Set of Disjunctive Sequences? J. UCS 8(2): 348-362 (2002)
49EELudwig Staiger: The Kolmogorov complexity of real numbers. Theor. Comput. Sci. 284(2): 455-466 (2002)
2001
48EELudwig Staiger: The Entropy of Lukasiewicz-Languages. Developments in Language Theory 2001: 155-165
47 Ludwig Staiger: Topologies for the Set of Disjunctive omega-Words. Words, Semigroups, and Transductions 2001: 421-430
46 Henning Fernau, Ludwig Staiger: Iterated Function Systems and Control Languages. Inf. Comput. 168(2): 125-143 (2001)
1999
45 Henning Fernau, Klaus Reinhardt, Ludwig Staiger: Decidability of code properties. Developments in Language Theory 1999: 153-163
44EELudwig Staiger: The Kolmogorov Complexity of Real Numbers. FCT 1999: 536-546
43EEHelmut Jürgensen, Ludwig Staiger: Finite Automata Encoding Geometric Figures. WIA 1999: 101-108
42 Ludwig Staiger: On the Power of Reading the Whole Infinite Input Tape. Grammars 2(3): 247-257 (1999)
1998
41EEHenning Fernau, Ludwig Staiger: IFS and Control Languages. MFCS 1998: 740-750
40 Ludwig Staiger: The Hausdorff Measure of Regular omega-languages is Computable. Bulletin of the EATCS 66: 178-182 (1998)
39 Ludwig Staiger: A. Tight Upper Bound on Kolmogorov Complexity and Uniformly Optimal Prediction. Theory Comput. Syst. 31(3): 215-229 (1998)
1997
38 Ludwig Staiger: Rich omega-Words and Monadic Second-Order Arithmetic. CSL 1997: 478-490
37 Ludwig Staiger: On omega-power Languages. New Trends in Formal Languages 1997: 377-394
36EEIgor Litovsky, Ludwig Staiger: Finite Acceptance of Infinite Words. Theor. Comput. Sci. 174(1-2): 1-21 (1997)
35EEOded Maler, Ludwig Staiger: On Syntactic Congruences for Omega-Languages. Theor. Comput. Sci. 183(1): 93-112 (1997)
1996
34EELudwig Staiger: Codes, Simplifying Words, and Open Set Condition. Inf. Process. Lett. 58(6): 297-301 (1996)
1995
33 Igor Litovsky, Ludwig Staiger: Finite Acceptance of Infinite Words. Developments in Language Theory 1995: 360-369
32 Helmut Jürgensen, Ludwig Staiger: Local Hausdorff Dimension Acta Inf. 32(5): 491-507 (1995)
1994
31 Henning Fernau, Ludwig Staiger: Valuations and Unambiguity of Languages, with Applications to Fractal Geometry. ICALP 1994: 11-22
30EEJeanne Devolder, Michel Latteux, Igor Litovsky, Ludwig Staiger: Codes and Infinite Words. Acta Cybern. 11(4): 241-256 (1994)
29 Wolfgang Merzenich, Ludwig Staiger: Fractals, Dimension, and Formal Languages. ITA 28(3-4): 361-386 (1994)
1993
28 Wolfgang Merzenich, Ludwig Staiger: Fractals, Dimension, and Formal Languages. Developments in Language Theory 1993: 262-277
27 Oded Maler, Ludwig Staiger: On Syntactic Congruences for Omega-Languages. STACS 1993: 586-594
26 Ludwig Staiger: Recursive Automata on Infinite Words. STACS 1993: 629-639
25 Ludwig Staiger: Kolgomorov Complexity and Hausdorff Dimension Inf. Comput. 103(2): 159-194 (1993)
1991
24 Ludwig Staiger: On Codes having Dual Distance d'>=k. Elektronische Informationsverarbeitung und Kybernetik 27(7): 377-383 (1991)
1989
23 Ludwig Staiger: Kolmogorov Complexity and Hausdorff Dimension. FCT 1989: 434-443
22 Ludwig Staiger: On the weight distribution of linear codes having dual distance d' geq k. IEEE Transactions on Information Theory 35(1): 186- (1989)
1988
21 Ludwig Staiger: Ein Satz über die Entropie von Untermonoiden (A Theorem on the Entropy of Submonoids). Theor. Comput. Sci. 61: 279-282 (1988)
1987
20 Ludwig Staiger: Why are Serial Convolutional Encoders Catastrophic? Elektronische Informationsverarbeitung und Kybernetik 23(12): 609-614 (1987)
19 Ludwig Staiger: Research in the Theory of omega-languages. Elektronische Informationsverarbeitung und Kybernetik 23(8/9): 415-439 (1987)
18 Ludwig Staiger: Sequential Mappings of omega-Languages. ITA 21(2): 147-173 (1987)
1986
17 Ludwig Staiger, Werner Nehrlich: The Centers of Context-Sensitive Languages. MFCS 1986: 594-601
16 Ludwig Staiger: Hierarchies of Recursive omega-languages. Elektronische Informationsverarbeitung und Kybernetik 22(5/6): 219-241 (1986)
15 Ludwig Staiger: On Infinitary Finite Length Codes. ITA 20(4): 483-494 (1986)
1984
14 Ludwig Staiger: Projection Lemmas for omega-Languages. Theor. Comput. Sci. 32: 331-337 (1984)
1983
13 Ludwig Staiger: Subspaces of GF(q)^w and Convolutional Codes Information and Control 59(1-3): 148-183 (1983)
12 Ludwig Staiger: Finite-State omega-Languages. J. Comput. Syst. Sci. 27(3): 434-448 (1983)
1981
11 Ludwig Staiger: Complexity and Entropy. MFCS 1981: 508-514
1980
10 Ludwig Staiger: A Note on Connected omega-Languages. Elektronische Informationsverarbeitung und Kybernetik 16(5/6): 245-251 (1980)
1977
9 Ludwig Staiger: Empty - Storage - Acceptance of omega-Languages. FCT 1977: 516-521
8 Klaus W. Wagner, Ludwig Staiger: Recursive omega-Languages. FCT 1977: 532-537
1976
7 Ludwig Staiger: Quasilineare Automaten und die von ihnen realisierten Operatoren. Elektronische Informationsverarbeitung und Kybernetik 12(1/2): 83-92 (1976)
6 Ludwig Staiger: Reguläre Nullmengen. Elektronische Informationsverarbeitung und Kybernetik 12(6): 307-311 (1976)
1974
5 Klaus W. Wagner, Ludwig Staiger: Finite Automata Acceptation of Infinite Sequences. MFCS 1974: 69-72
4 Rolf Lindner, Ludwig Staiger: Eine Bemerkung über nichtkonstantenfreie sequentielle Operatoren. Elektronische Informationsverarbeitung und Kybernetik 10(4): 195-202 (1974)
3 Ludwig Staiger, Klaus W. Wagner: Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen. Elektronische Informationsverarbeitung und Kybernetik 10(7): 379-392 (1974)
1972
2 Ludwig Staiger: Eine Bemerkung zur Charakterisierung von Folgenmengen durch Wortmengen. Elektronische Informationsverarbeitung und Kybernetik 8(10): 589-592 (1972)
1 Dorothee Arold, Lutz Bernhardt, Ludwig Staiger: Über die Entscheidung und Aufzählung regulärer Wortmengen durch Markowsche Algorithmen. Elektronische Informationsverarbeitung und Kybernetik 8(2/3): 99-114 (1972)

Coauthor Index

1Dorothee Arold [1]
2Lutz Bernhardt [1]
3Vasco Brattka [61]
4Cristian S. Calude (Cristian Calude) [53] [56] [64] [69] [70]
5Jeanne Devolder [30]
6Henning Fernau [31] [41] [45] [46]
7Rudolf Freund [54]
8T. Aaron Gulliver [60]
9Helmut Jürgensen [32] [43] [66]
10Michel Latteux [30]
11Rolf Lindner [4]
12Igor Litovsky [30] [33] [36]
13Oded Maler [27] [35]
14Solomon Marcus [53]
15Wolfgang Merzenich [28] [29]
16Werner Nehrlich [17]
17Radu Nicolescu [60]
18André Nies [69]
19Marion Oswald [54]
20Klaus Reinhardt [45]
21Ulrich Speidel [60]
22Frank Stephan [69]
23Sebastiaan Terwijn [64]
24Mark R. Titchener [60]
25Klaus W. Wagner [3] [5] [8]
26Klaus Weihrauch [61]
27Hideki Yamasaki [51] [66]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)