default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLudwig Staiger
Person information
- affiliation: Martin Luther University of Halle-Wittenberg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j69]Ludwig Staiger
:
Topologies for Finite Words: Compatibility with the Cantor Topology. RAIRO Theor. Informatics Appl. 58: 2 (2024)- 2023
- [j68]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: 113819 (2023) - 2021
- [j67]Ludwig Staiger:
The Maximal Complexity of Quasiperiodic Infinite Words. Axioms 10(4): 306 (2021) - [j66]Helmut Jürgensen, Ludwig Staiger:
Automata for solid codes. Theor. Comput. Sci. 892: 25-47 (2021) - [j65]Cristian S. Calude, Karen Frilya Celine, Ziyuan Gao, Sanjay Jain, Ludwig Staiger, Frank Stephan:
Bi-immunity over different size alphabets. Theor. Comput. Sci. 894: 31-49 (2021) - 2020
- [j64]Ludwig Staiger:
On the incomputability of computable dimension. Log. Methods Comput. Sci. 16(2) (2020) - [c42]Ludwig Staiger:
On the Generative Power of Quasiperiods. DCFS 2020: 219-230
2010 – 2019
- 2019
- [c41]Rudolf Freund, Ludwig Staiger:
Turing machines with activations of transitions. NCMA 2019: 79-91 - [i6]Ludwig Staiger:
On the incomputability of computable dimension. CoRR abs/1904.13112 (2019) - 2018
- [j63]Cristian S. Calude, Ludwig Staiger:
A Simple Construction of Absolutely Disjunctive Liouville Numbers. J. Autom. Lang. Comb. 23(1-3): 103-109 (2018) - [j62]Cristian S. Calude, Ludwig Staiger:
Liouville, Computable, Borel Normal and Martin-Löf Random Numbers. Theory Comput. Syst. 62(7): 1573-1585 (2018) - [c40]Ludwig Staiger:
Finite Automata and Randomness. DCFS 2018: 1-10 - [c39]Birzhan Moldagaliyev, Ludwig Staiger, Frank Stephan:
On the Values for Factor Complexity. CIAA 2018: 274-285 - 2017
- [j61]Ludwig Staiger:
Exact Constructive and Computable Dimensions. Theory Comput. Syst. 61(4): 1288-1314 (2017) - [j60]Stefan Hoffmann, Sibylle Schwarz, Ludwig Staiger:
Shift-invariant topologies for the Cantor space Xω. Theor. Comput. Sci. 679: 145-161 (2017) - 2016
- [j59]Cristian S. Calude, Ludwig Staiger, Frank Stephan:
Finite state incompressible infinite sequences. Inf. Comput. 247: 23-36 (2016) - [j58]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): 51-69 (2016) - [j57]Ronney Polley, Ludwig Staiger:
Quasiperiods, Subword Complexity and the Smallest Pisot Number. J. Autom. Lang. Comb. 21(1-2): 93-106 (2016) - [i5]Ludwig Staiger:
Bounds on the Kolmogorov complexity function for infinite words. Electron. Colloquium Comput. Complex. TR16 (2016) - [i4]Ludwig Staiger:
Exact constructive and computable dimensions. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j56]Ludwig Staiger:
On the Hausdorff measure of regular ω-languages in Cantor space. Discret. Math. Theor. Comput. Sci. 17(1): 357-368 (2015) - [c38]Rudolf Freund, Sergiu Ivanov, Ludwig Staiger:
Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer ω-Languages. UCNC 2015: 169-180 - [c37]Stefan Hoffmann, Ludwig Staiger:
Subword Metrics for Infinite Words. CIAA 2015: 165-175 - 2014
- [c36]Cristian S. Calude, Ludwig Staiger, Frank Stephan:
Finite State Incompressible Infinite Sequences. TAMC 2014: 50-66 - [p3]Ludwig Staiger:
Two Theorems on the Hausdorff Measure of Regular ω-Languages. Logic, Computation, Hierarchies 2014: 383-392 - 2012
- [c35]Ludwig Staiger:
On Oscillation-Free Chaitin h-Random Sequences. Computation, Physics and Beyond 2012: 194-202 - [c34]Ludwig Staiger:
Asymptotic Subword Complexity. Languages Alive 2012: 236-245 - [c33]Ludwig Staiger:
A Correspondence Principle for Exact Constructive Dimension. CiE 2012: 686-695 - 2011
- [j55]Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan:
Universal recursively enumerable sets of strings. Theor. Comput. Sci. 412(22): 2253-2261 (2011) - [c32]Ludwig Staiger:
Constructive Dimension and Hausdorff Dimension: The Case of Exact Dimension. FCT 2011: 252-263 - [i3]Ludwig Staiger:
Exact constructive dimension. Electron. Colloquium Comput. Complex. TR11 (2011) - [i2]Ludwig Staiger:
Oscillation-free Chaitin h-random sequences. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j54]Cristian S. Calude, Ludwig Staiger:
A note on accelerated Turing machines. Math. Struct. Comput. Sci. 20(6): 1011-1017 (2010) - [c31]Ludwig Staiger:
Joint Topologies for Finite and Infinite Words. Developments in Language Theory 2010: 442-443 - [c30]Sibylle Schwarz, Ludwig Staiger:
Topologies Refining the Cantor Topology on Xomega. IFIP TCS 2010: 271-285 - [c29]Ronny Polley, Ludwig Staiger:
The Maximal Subword Complexity of Quasiperiodic Infinite Words. DCFS 2010: 169-176
2000 – 2009
- 2009
- [j53]Cristian S. Calude, Ludwig Staiger:
On universal computably enumerable prefix codes. Math. Struct. Comput. Sci. 19(1): 45-57 (2009) - [j52]Cristian S. Calude, Helmut Jürgensen, Ludwig Staiger:
Topology on words. Theor. Comput. Sci. 410(24-25): 2323-2335 (2009) - [c28]Jöran Mielke, Ludwig Staiger:
On Oscillation-free epsilon-random Sequences II. CCA 2009 - 2008
- [c27]Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan:
Universal Recursively Enumerable Sets of Strings. Developments in Language Theory 2008: 170-182 - [c26]Ludwig Staiger:
On Oscillation-free epsilon-random Sequences. CCA 2008: 287-297 - 2007
- [j51]Ludwig Staiger:
On Maximal Prefix Codes. Bull. EATCS 91: 205-207 (2007) - [j50]Ludwig Staiger:
Prefix-Free Lukasiewicz Languages. Int. J. Found. Comput. Sci. 18(6): 1417-1423 (2007) - [j49]Henning Fernau, Klaus Reinhardt, Ludwig Staiger:
Decidability of code properties. RAIRO Theor. Informatics Appl. 41(3): 243-259 (2007) - [j48]Helmut Jürgensen, Ludwig Staiger, Hideki Yamasaki:
Finite automata encoding geometric figures. Theor. Comput. Sci. 381(1-3): 33-43 (2007) - [j47]Ludwig Staiger:
The Kolmogorov complexity of infinite words. Theor. Comput. Sci. 383(2-3): 187-199 (2007) - 2006
- [j46]Cristian S. Calude, Ludwig Staiger, Sebastiaan Terwijn:
On partial randomness. Ann. Pure Appl. Log. 138(1-3): 20-30 (2006) - [i1]Ludwig Staiger:
The Kolmogorov complexity of infinite words. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j45]Ludwig Staiger:
Topologies for the Set of Disjunctive oemga-words. Acta Cybern. 17(1): 43-51 (2005) - [j44]Mark R. Titchener, Radu Nicolescu, Ludwig Staiger, T. Aaron Gulliver, Ulrich Speidel:
Deterministic Complexity and Entropy. Fundam. Informaticae 64(1-4): 443-461 (2005) - [j43]Ludwig 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) - [j42]Ludwig Staiger:
Constructive dimension equals Kolmogorov complexity. Inf. Process. Lett. 93(3): 149-153 (2005) - [j41]Ludwig Staiger:
The entropy of Lukasiewicz-languages. RAIRO Theor. Informatics Appl. 39(4): 621-639 (2005) - [j40]Ludwig Staiger:
Hausdorff Measure and Lukasiewicz Languages. J. Univers. Comput. Sci. 11(12): 2114-2124 (2005) - [j39]Cristian S. Calude, Ludwig Staiger:
Generalisations of disjunctive sequences. Math. Log. Q. 51(2): 120-128 (2005) - [c25]Ludwig Staiger:
The Kolmogorov complexity of infinite objects. DCFS 2005: 39-50 - [e1]Vasco Brattka, Ludwig Staiger, Klaus Weihrauch:
Proceedings of the 6th Workshop on Computability and Complexity in Analysis, CCA 2004, Wittenberg, Germany, August 16-20, 2004. Electronic Notes in Theoretical Computer Science 120, Elsevier 2005 [contents] - 2004
- [c24]Ludwig Staiger:
On the Hausdorff Measure of omega-Power Languages. Developments in Language Theory 2004: 393-405 - [c23]Vasco Brattka, Ludwig Staiger, Klaus Weihrauch:
Preface. CCA 2004: 1- - 2003
- [j38]Cristian Calude, Solomon Marcus, Ludwig Staiger:
A topological characterization of random sequences. Inf. Process. Lett. 88(5): 245-250 (2003) - [j37]Ludwig Staiger:
Weighted Finite Automata and Metrics in Cantor Space. J. Autom. Lang. Comb. 8(2): 353-360 (2003) - [c22]Rudolf Freund, Marion Oswald, Ludwig Staiger:
omega-P Automata with Communication Rules. Workshop on Membrane Computing 2003: 203-217 - 2002
- [j36]Ludwig Staiger, Hideki Yamasaki:
A Simple Example of an omega-Language Topologically. Bull. EATCS 78 (2002) - [j35]Ludwig Staiger:
How Large is the Set of Disjunctive Sequences? J. Univers. Comput. Sci. 8(2): 348-362 (2002) - [j34]Ludwig Staiger:
The Kolmogorov complexity of real numbers. Theor. Comput. Sci. 284(2): 455-466 (2002) - 2001
- [j33]Henning Fernau, Ludwig Staiger:
Iterated Function Systems and Control Languages. Inf. Comput. 168(2): 125-143 (2001) - [c21]Rudolf Freund, Ludwig Staiger:
Acceptance of omega-languages by communicating deterministic turing maching. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 115-126 - [c20]Ludwig Staiger:
Topologies for the Set of Disjunctive omega-Words. Words, Semigroups, and Transductions 2001: 421-430 - [c19]Ludwig Staiger:
The Entropy of Lukasiewicz-Languages. Developments in Language Theory 2001: 155-165 - [c18]Ludwig Staiger:
How Large is the Set of Disjunctive Sequences? DMTCS 2001: 215-225 - 2000
- [p2]Ludwig Staiger:
On the Power of Reading the Whole Infinite Input Tape. Finite Versus Infinite 2000: 335-348
1990 – 1999
- 1999
- [j32]Ludwig Staiger:
On the Power of Reading the Whole Infinite Input Tape. Grammars 2(3): 247-257 (1999) - [c17]Henning Fernau, Klaus Reinhardt, Ludwig Staiger:
Decidability of code properties. Developments in Language Theory 1999: 153-163 - [c16]Ludwig Staiger:
The Kolmogorov Complexity of Real Numbers. FCT 1999: 536-546 - [c15]Helmut Jürgensen, Ludwig Staiger:
Finite Automata Encoding Geometric Figures. WIA 1999: 101-108 - 1998
- [j31]Ludwig Staiger:
The Hausdorff Measure of Regular omega-languages is Computable. Bull. EATCS 66: 178-182 (1998) - [j30]Ludwig Staiger:
A. Tight Upper Bound on Kolmogorov Complexity and Uniformly Optimal Prediction. Theory Comput. Syst. 31(3): 215-229 (1998) - [c14]Henning Fernau, Ludwig Staiger:
IFS and Control Languages. MFCS 1998: 740-750 - 1997
- [j29]Igor Litovsky, Ludwig Staiger:
Finite Acceptance of Infinite Words. Theor. Comput. Sci. 174(1-2): 1-21 (1997) - [j28]Oded Maler, Ludwig Staiger:
On Syntactic Congruences for Omega-Languages. Theor. Comput. Sci. 183(1): 93-112 (1997) - [c13]Ludwig Staiger:
On omega-power Languages. New Trends in Formal Languages 1997: 377-394 - [c12]Ludwig Staiger:
Rich omega-Words and Monadic Second-Order Arithmetic. CSL 1997: 478-490 - [p1]Ludwig Staiger:
ω-Languages. Handbook of Formal Languages (3) 1997: 339-387 - 1996
- [j27]Ludwig Staiger:
Codes, Simplifying Words, and Open Set Condition. Inf. Process. Lett. 58(6): 297-301 (1996) - 1995
- [j26]Helmut Jürgensen, Ludwig Staiger:
Local Hausdorff Dimension. Acta Informatica 32(5): 491-507 (1995) - [c11]Igor Litovsky, Ludwig Staiger:
Finite Acceptance of Infinite Words. Developments in Language Theory 1995: 360-369 - 1994
- [j25]Jeanne Devolder, Michel Latteux, Igor Litovsky, Ludwig Staiger:
Codes and Infinite Words. Acta Cybern. 11(4): 241-256 (1994) - [j24]Wolfgang Merzenich, Ludwig Staiger:
Fractals, Dimension, and Formal Languages. RAIRO Theor. Informatics Appl. 28(3-4): 361-386 (1994) - [c10]Henning Fernau, Ludwig Staiger:
Valuations and Unambiguity of Languages, with Applications to Fractal Geometry. ICALP 1994: 11-22 - 1993
- [j23]Ludwig Staiger:
Kolgomorov Complexity and Hausdorff Dimension. Inf. Comput. 103(2): 159-194 (1993) - [c9]Wolfgang Merzenich, Ludwig Staiger:
Fractals, Dimension, and Formal Languages. Developments in Language Theory 1993: 262-277 - [c8]Oded Maler, Ludwig Staiger:
On Syntactic Congruences for Omega-Languages. STACS 1993: 586-594 - [c7]Ludwig Staiger:
Recursive Automata on Infinite Words. STACS 1993: 629-639 - 1991
- [j22]Ludwig Staiger:
On Codes having Dual Distance d'>=k. J. Inf. Process. Cybern. 27(7): 377-383 (1991)
1980 – 1989
- 1989
- [j21]Ludwig Staiger:
On the weight distribution of linear codes having dual distance d' geq k. IEEE Trans. Inf. Theory 35(1): 186-188 (1989) - [c6]Ludwig Staiger:
Kolmogorov Complexity and Hausdorff Dimension. FCT 1989: 434-443 - 1988
- [j20]Ludwig Staiger:
Ein Satz über die Entropie von Untermonoiden (A Theorem on the Entropy of Submonoids). Theor. Comput. Sci. 61: 279-282 (1988) - 1987
- [j19]Ludwig Staiger:
Research in the Theory of omega-languages. J. Inf. Process. Cybern. 23(8/9): 415-439 (1987) - [j18]Ludwig Staiger:
Why are Serial Convolutional Encoders Catastrophic? J. Inf. Process. Cybern. 23(12): 609-614 (1987) - [j17]Ludwig Staiger:
Sequential Mappings of omega-Languages. RAIRO Theor. Informatics Appl. 21(2): 147-173 (1987) - 1986
- [j16]Ludwig Staiger:
Hierarchies of Recursive omega-languages. J. Inf. Process. Cybern. 22(5/6): 219-241 (1986) - [j15]Ludwig Staiger:
On Infinitary Finite Length Codes. RAIRO Theor. Informatics Appl. 20(4): 483-494 (1986) - [c5]Ludwig Staiger, Werner Nehrlich:
The Centers of Context-Sensitive Languages. MFCS 1986: 594-601 - 1985
- [j14]Ludwig Staiger:
Representable P. Martin-Löf tests. Kybernetika 21(3): 235-243 (1985) - 1984
- [j13]Ludwig Staiger:
Projection Lemmas for omega-Languages. Theor. Comput. Sci. 32: 331-337 (1984) - 1983
- [j12]Ludwig Staiger:
Subspaces of GF(q)^w and Convolutional Codes. Inf. Control. 59(1-3): 148-183 (1983) - [j11]Ludwig Staiger:
Finite-State omega-Languages. J. Comput. Syst. Sci. 27(3): 434-448 (1983) - 1981
- [c4]Ludwig Staiger:
Complexity and Entropy. MFCS 1981: 508-514 - 1980
- [j10]Ludwig Staiger:
A Note on Connected omega-Languages. J. Inf. Process. Cybern. 16(5/6): 245-251 (1980)
1970 – 1979
- 1978
- [j9]Ludwig Staiger, Klaus W. Wagner:
Rekursive Folgenmengen I. Math. Log. Q. 24(31-36): 523-538 (1978) - 1977
- [j8]Rolf Lindner, Ludwig Staiger:
Erkennungs-, Masz- Und Informationstheoretische Eigenschaften Regulärer Folgenmengen. Math. Log. Q. 23(18): 283-287 (1977) - [c3]Ludwig Staiger:
Empty - Storage - Acceptance of omega-Languages. FCT 1977: 516-521 - [c2]Klaus W. Wagner, Ludwig Staiger:
Recursive omega-Languages. FCT 1977: 532-537 - 1976
- [j7]Ludwig Staiger:
Quasilineare Automaten und die von ihnen realisierten Operatoren. J. Inf. Process. Cybern. 12(1/2): 83-92 (1976) - [j6]Ludwig Staiger:
Reguläre Nullmengen. J. Inf. Process. Cybern. 12(6): 307-311 (1976) - 1975
- [j5]Ludwig Staiger:
Quasilineare Automaten und die von ihnen realisierten Operatoren. J. Inf. Process. Cybern. 11(10-12): 574-575 (1975) - 1974
- [j4]Rolf Lindner, Ludwig Staiger:
Eine Bemerkung über nichtkonstantenfreie sequentielle Operatoren. J. Inf. Process. Cybern. 10(4): 195-202 (1974) - [j3]Ludwig Staiger, Klaus W. Wagner:
Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen. J. Inf. Process. Cybern. 10(7): 379-392 (1974) - [c1]Klaus W. Wagner, Ludwig Staiger:
Finite Automata Acceptation of Infinite Sequences. MFCS 1974: 69-72 - 1972
- [j2]Dorothee Arold, Lutz Bernhardt, Ludwig Staiger:
Über die Entscheidung und Aufzählung regulärer Wortmengen durch Markowsche Algorithmen. J. Inf. Process. Cybern. 8(2/3): 99-114 (1972) - [j1]Ludwig Staiger:
Eine Bemerkung zur Charakterisierung von Folgenmengen durch Wortmengen. J. Inf. Process. Cybern. 8(10): 589-592 (1972)
Coauthor Index
Cristian S. Calude
aka: Cristian Calude
aka: Cristian Calude
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
