14-03
|
Staiger, L.:
On the Hausdorff measure of regular ω-languages in Cantor space
|
14-01
|
Jürgensen, H. and
Staiger, L.:
Fault-Tolerant Acceptors for Solid Codes
|
12-01
|
Staiger, L.:
A Correspondence
Principle for Exact Constructive Dimension
|
11-10
|
Staiger, L.:
On Oscillation-free
Chaitin h-random sequences
|
11-09
|
Staiger, L.:
Asymptotic Subword Complexity
|
11-07
|
Staiger, L.:
Constructive Dimension and
Hausdorff Dimension: The Case of Exact Dimension
|
10-02
|
Polley, R. and Staiger, L.:
The Maximal Subword Complexity of Quasiperiodic
Infinite Words
|
10-01
|
Schwarz, S. and Staiger, L.:
Topologies refining
the Cantor topology on
Xω
|
09-03
|
Mielke,
J., Staiger,
L. and Winter R.:
Theorietag Automaten und Formale Sprachen 2009
|
09-02
|
Mielke,
J. and Staiger,
L.:
On Oscillation-free
ε-random Sequences II
|
08-08
| Schwarz, S.:
22nd Workshop on (Constraint) Logic Programming
|
08-03
|
Staiger,
L.:
On Oscillation-free ε-random Sequences
|
08-02
|
Mielke, J.:
Refined Bounds on
Kolmogorov Complexity for ω-Languages
|
07-01
|
Calude C.S.;
Staiger,
L.:
On Universal Computably Enumerable Prefix Codes
|
06-07
|
Staiger,
L.:
The Kolmogorov Complexity of
Infinite Words
|
05-11
|
Staiger,
L.:
Hausdorff Measure and Lukasiewicz Languages
|
04-23
|
Calude C.S.;
Staiger,
L.; Svozil K.:
Randomness Relative to Cantor Expansions
|
04-15
|
Jürgensen,
H.; Staiger,
L.; Yamasaki, H.:
Finite Automata Encoding
Geometric Figures
|
04-14
|
Calude C.S.;
Staiger,
L.:
Generalisations of
Disjunctive Sequences
|
04-09
|
Blaar, H.;
Karnstedt, M.; Lange, T.; Winter, R.:
Possibilities to solve the
clique problem by thread parallelism using task pools
|
02-16
|
Mazala, R.,
Staiger, L., Winter, R. (Hrsg.
):
12. Theorietag "Automaten
und Formale Sprachen"
|
02-15
|
Staiger, L.:
How Large is the Set of
Disjunctive Sequences?
|
01-15
|
Staiger, L.:
Topologies for the Set of Disjunctive ω-words
|
01-12
|
Winter, R.:
Kryptoalgorithmen unter Ausnutzung der
Komplexität des Clique-Problems
|
00-18
|
Fernau,
H.; Stiebe, R.:
Valences in Parallel Systems
|
00-11
|
Fernau,
H.; Reinhardt, K.; Staiger, L.:
Decidability of Code
Properties
|
00-04
|
Moriya, T.:
Closure
under Composition and Syntactic Monoids of some Codes
|
99-29
|
Freund,
R., Staiger, L.:
Acceptance
of ω-Languages by
Communicating Deterministic Turing Machines
|
99-17
|
Yamasaki,
H.:
Logical
Characterization of Petri Net ω-Languages
|
99-16
|
Fernau, H.;
Staiger, L.:
Iterated Function Systems and Control
Languages
|
99-15
|
Staiger, L.:
On
the Power of Reading the Whole Infinite Input Tape
|
99-14
|
Staiger, L.:
The
Kolmogorov Complexity of Liouville Numbers
|
99-13
|
Staiger, L.:
How
much can you win when your adversary is handicapped?
|
98-36
|
Fernau, H.; Stiebe, R.:
Regulation by Valences
|
98-30
|
Staiger, L.:
The Hausdorff Measure of Regular ω-languages is
Computable
|
98-06
|
Staiger, L.:
Rich ω-Words
and Monadic Second-Order Arithmetic
|
97-09
|
Staiger,
L.:
ω-languages
|
96-43
|
Molitor,
P.; Näher,
S.;
Rojas, R.; Staiger,
L.:
Beiträge zur Informatik
|
95-07
|
Head,
T.; Weber, A.:
Deciding Multiset Decipherability
|
