Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,155,883 papers from all fields of science
Search
Sign In
Create Free Account
Ludwig Staiger
Ludwig Staiger is a German mathematician and computer scientist at the Martin-Luther-Universität Halle-Wittenberg, Germany.Previously he had…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Algorithmic information theory
Automata theory
Computer scientist
Electronic Colloquium on Computational Complexity
Expand
Broader (1)
Theory of computation
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Turing machines with activations of transitions
R. Freund
,
L. Staiger
Workshop on Non-Classical Models for Automata and…
2019
Corpus ID: 195856904
We consider Turing machines which perform infinite sequences of runs, where the (finite) number of computation steps in each run…
Expand
2012
2012
Is there a universal image generator?
Cristian S. Calude
,
J. P. Lewis
Applied Mathematics and Computation
2012
Corpus ID: 7896664
Review
2011
Review
2011
The lichens of Fakahatchee Strand Preserve State Park, Florida: Proceedings from the 18th Tuckerman Workshop
R. Lücking
,
F. Seavey
,
+10 authors
J. Mercado
2011
Corpus ID: 134136688
Fakahatchee Strand Preserve State Park is located in Collier County at the extreme southwestern corner of Florida, close to…
Expand
2010
2010
A CTL-Based Logic for Program Abstractions
M. Lange
,
Markus Latte
Workshop on Logic, Language, Information and…
2010
Corpus ID: 8977869
We define an action-based extension of the branching-time temporal logic CTL which allows path quantifiers to be restricted by…
Expand
2009
2009
Series Is there a Universal Image Generator ?
Cristian S. Calude
,
J. P. Lewis
2009
Corpus ID: 14621172
Synthetic pattern generation procedures have various applications, and a number of approaches (fractals, L-systems, etc.) have…
Expand
2009
2009
Series Universal Recursively Enumerable Sets of Strings
Cristian S. Calude
,
A. Nies
,
L. Staiger
,
F. Stephan
2009
Corpus ID: 17906402
The main topic of the present work are universal machines for plain and prefix-free description complexity and their domains. It…
Expand
2008
2008
On the bounds of the Titchener T-complexity
U. Speidel
International Symposium on Communication Systems…
2008
Corpus ID: 18638361
Titchenerpsilas T-complexity is a computable complexity measure for finite strings with practical applications in a number of…
Expand
2008
2008
L O ] 10 S ep 2 00 8 Topological Complexity of ω-Powers : Extended Abstract
O. Finkel
,
D. Lecomte
2008
Corpus ID: 115202895
The operationV → V ω is a fundamental operation over finitary languages leading t o ω-languages. It produces ω-powers, i.e…
Expand
Review
2005
Review
2005
The WTO Dispute Settlement Mechanism: Battlefield or Cooperation?
Wilhelm Kohler
2005
Corpus ID: 9252641
EU-US trade disputes have recently caught much attention, because they have involved lasting non-compliance coupled with WTO…
Expand
2003
2003
Complexity and Randomness Course notes , University of Auckland , March 2003
S. Terwijn
2003
Corpus ID: 7600606
2 Random finite strings 7 2.1 Plain Kolmogorov complexity . . . . . . . . . . . . . . . . . . 7 2.2 Prefix-free complexity…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE