 |
Reinhardt
2012:
Regular Languages are Church-Rosser Congruential
Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter
Automata, Languages, and Programming, Lecture Notes in Computer Science, Volume 7392, Pages 177-188, Springer-Verlag, 2012.
[arXiv:1202.1148v1]
[© Springer-Verlag]
This contribution received the best paper award in track B.
1995:
The Tautologies over a finite set are context-free
Michael Bertol, Klaus Reinhardt
Bulletin of the European Association for Theoretical Computer Science Number 57.
ps File.
ps.gz File.
On Codings of Traces
Volker Diekert, Anca Muscholl, Klaus Reinhardt
STACS'95, LNCS 900, 1995.
Abstract, BibTeX entry,
dvi File,
ps.Z File
(© Springer-Verlag).
1994:
On confluent semi-commutation systems - decidability
and complexity results
Volker Diekert, Edward Ochmanski, Klaus Reinhardt
Information and Computation 110, 164-182, 1994.
1992:
Counting and empty alternating pushdown automata
Klaus Reinhardt
In 7th IMYCS, Smolenice Castle, Tschechoslowakei,
1992.
Sorting in-place with a worst case complexity of n log
n - 1.3 n + o(log n) comparisons and epsilon n log n+ o(1)
transports
Klaus Reinhardt
In Proceedings of the 3rd ISAAC 92, 1992.
LNCS 650, 1992.
|
|
