Остановите войну!
for scientists:
default search action
Ludwig Staiger
- > Home > Persons > Ludwig Staiger
Publications
- 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
- [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) - 2019
- [c41]Rudolf Freund, Ludwig Staiger:
Turing machines with activations of transitions. NCMA 2019: 79-91 - 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) - [c39]Birzhan Moldagaliyev, Ludwig Staiger, Frank Stephan:
On the Values for Factor Complexity. CIAA 2018: 274-285 - 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) - 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 - 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) - 2010
- [j54]Cristian S. Calude, Ludwig Staiger:
A note on accelerated Turing machines. Math. Struct. Comput. Sci. 20(6): 1011-1017 (2010) - [c30]Sibylle Schwarz, Ludwig Staiger:
Topologies Refining the Cantor Topology on Xomega. IFIP TCS 2010: 271-285 - 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) - 2008
- [c27]Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan:
Universal Recursively Enumerable Sets of Strings. Developments in Language Theory 2008: 170-182 - 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) - 2006
- [j46]Cristian S. Calude, Ludwig Staiger, Sebastiaan Terwijn:
On partial randomness. Ann. Pure Appl. Log. 138(1-3): 20-30 (2006) - 2005
- [j39]Cristian S. Calude, Ludwig Staiger:
Generalisations of disjunctive sequences. Math. Log. Q. 51(2): 120-128 (2005) - [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
- [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) - [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) - 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 - 1999
- [c17]Henning Fernau, Klaus Reinhardt, Ludwig Staiger:
Decidability of code properties. Developments in Language Theory 1999: 153-163 - [c15]Helmut Jürgensen, Ludwig Staiger:
Finite Automata Encoding Geometric Figures. WIA 1999: 101-108 - 1998
- [c14]Henning Fernau, Ludwig Staiger:
IFS and Control Languages. MFCS 1998: 740-750 - 1995
- [j26]Helmut Jürgensen, Ludwig Staiger:
Local Hausdorff Dimension. Acta Informatica 32(5): 491-507 (1995) - 1994
- [c10]Henning Fernau, Ludwig Staiger:
Valuations and Unambiguity of Languages, with Applications to Fractal Geometry. ICALP 1994: 11-22
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 2024-05-02 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint