Award1020: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Serge Stratan (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Award |Titel DE=N. J. Lehmann Award |Titel EN=N. J. Lehmann Award |Beschreibung DE=Stefan Borgwardt received the N. J. Lehmann Award of the TU Dresden for hi…“) |
Sibylle Möhle (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| Zeile 3: | Zeile 3: | ||
|Titel EN=N. J. Lehmann Award | |Titel EN=N. J. Lehmann Award | ||
|Beschreibung DE=Stefan Borgwardt received the N. J. Lehmann Award of the TU Dresden for his Diploma thesis on 'The Infimum Problem as a Generalization of the Inclusion Problem for Automata'. Here is a [https://lat.inf.tu-dresden.de/research/NJLehmannAward2011.html picture] of the award ceremony. | |Beschreibung DE=Stefan Borgwardt received the N. J. Lehmann Award of the TU Dresden for his Diploma thesis on 'The Infimum Problem as a Generalization of the Inclusion Problem for Automata'. Here is a [https://lat.inf.tu-dresden.de/research/NJLehmannAward2011.html picture] of the award ceremony. | ||
|Beschreibung EN=Stefan Borgwardt received the N. J. Lehmann Award of the TU Dresden for his Diploma thesis on 'The Infimum Problem as a Generalization of the Inclusion Problem for Automata'. Here is a [https://lat.inf.tu-dresden.de/research/NJLehmannAward2011.html picture] of the award ceremony. | |Beschreibung EN=Stefan Borgwardt received the N. J. Lehmann Award of the TU Dresden for his Diploma thesis on 'The Infimum Problem as a Generalization of the Inclusion Problem for Automata'. Here is a [https://lat.inf.tu-dresden.de/research/NJLehmannAward2011.html picture] of the award ceremony. | ||
|Person=Stefan Borgwardt | |Person=Stefan Borgwardt | ||
|Forschungsgruppe=Automatentheorie | |Forschungsgruppe=Automatentheorie | ||
|Year=2011 | |Year=2011 | ||
}} | }} | ||
Aktuelle Version vom 30. August 2016, 14:12 Uhr
N. J. Lehmann Award
Stefan Borgwardt received the N. J. Lehmann Award of the TU Dresden for his Diploma thesis on 'The Infimum Problem as a Generalization of the Inclusion Problem for Automata'. Here is a picture of the award ceremony.
