Bild mit Unilogo
homeicon uni sucheicon suche kontakticon kontakt impressicon impressum
unilogo Universität Stuttgart 
Institut für Formale Methoden der Informatik

Abteilung Theoretische Informatik

 

Veröffentlichungen / Publications

1993


Almost-everywhere Complexity Hierarchies for Nondeterministic Time

E. Allender, R. Beigel, U. Hertrampf, S. Homer

Theoretical Computer Science 115(2), 225 - 242, 1993.

On the concatenation of infinite traces

Volker Diekert

TCS 113, 35-54, 1993.

Möbius functions and confluent semi-commutations

Volker Diekert

TCS 108, 25-43, 1993.

Rewriting, semi-commutations, and Möbius functions

Volker Diekert

FCT'93, LNCS 710, pp. 1-15, 1993. Abstract, BibTeX entry.

Complex and complex-like traces

Volker Diekert

MFCS'93, LNCS 711, pp. 68-82 1993. Abstract, BibTeX entry.

Deterministic asynchronous automata for infinite traces

Volker Diekert, Anca Muscholl

STACS'93, LNCS 665. Extended version in Acta Informatica vol. 31 (1994) Abstract, BibTeX entry, dvi File, ps.Z File.

On the Power of Polynomial Time Bit-Reductions

U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, K.W. Wagner

8th Conference on Structure in Complexity Theory, IEEE Computer Society Press, 200 - 207, 1993.