Skip to search formSkip to main contentSkip to account menu

Ludwig Staiger

Ludwig Staiger is a German mathematician and computer scientist at the Martin-Luther-Universität Halle-Wittenberg, Germany.Previously he had… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
  • R. FreundL. 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… 
2012
2012
Review
2011
Review
2011
Fakahatchee Strand Preserve State Park is located in Collier County at the extreme southwestern corner of Florida, close to… 
2010
2010
We define an action-based extension of the branching-time temporal logic CTL which allows path quantifiers to be restricted by… 
2009
2009
Synthetic pattern generation procedures have various applications, and a number of approaches (fractals, L-systems, etc.) have… 
2009
2009
The main topic of the present work are universal machines for plain and prefix-free description complexity and their domains. It… 
2008
2008
  • 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… 
2008
2008
The operationV → V ω is a fundamental operation over finitary languages leading t o ω-languages. It produces ω-powers, i.e… 
Review
2005
Review
2005
EU-US trade disputes have recently caught much attention, because they have involved lasting non-compliance coupled with WTO… 
2003
2003
2 Random finite strings 7 2.1 Plain Kolmogorov complexity . . . . . . . . . . . . . . . . . . 7 2.2 Prefix-free complexity…