| 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 |
|
 |
Technical Reports of the Department |
|
Technical Reports of the Institute |
