Karl-Heinz Diener

发表

Einfache Beweise Für Die Eindeutige Zerlegbarkeit Von Ausdrücken Endlicher und Unendlicher Sprachen

Karl-Heinz Diener, 1987, Math. Log. Q..

A Remark an Ascending Chain Conditions, the Countable Axiom of Choice and the Principle of Dependent Choices

Karl-Heinz Diener, 1994, Math. Log. Q..

On the Transitive Hull of a κ-Narrow Relation

Karl-Heinz Diener, 1992, Math. Log. Q..

e-Training for Critical Microelectronic Disciplines over the Fraunhofer Knowledge Network (FKN)

Peter Schwarz, Timm Ostermann, Ludger Krahn, 2002 .

On kappa-hereditary Sets and Consequences of the Axiom of Choice

Karl-Heinz Diener, 2000, Math. Log. Q..

Integrated design and test generation under internet based environment MOSCITO

Raimund Ubar, Zebo Peng, Wieslaw Kuzmicz, 2002, Proceedings Euromicro Symposium on Digital System Design. Architectures, Methods and Tools.

High-Level Synthesis and Test in the MOSCITO-Based Virtual Laboratory

Raimund Ubar, Jaan Raik, Manfred Glesner, 2002 .

On the Predecessor Relation in Abstract Algebras

Karl-Heinz Diener, 1993, Math. Log. Q..

Internet-based collaborative test generation with MOSCITO

Raimund Ubar, Jaan Raik, André Schneider, 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

On Constructing Infinitary Languages Lα β without the Axiom of Choice

Karl-Heinz Diener, 1983, Math. Log. Q..

Entwurfsautomatisierung – F&E-Arbeiten der Dresdner Außenstelle des Fraunhofer-Instituts für Integrierte Schaltungen

Günter Elst, Karl-Heinz Diener, 1997, Informatik Forschung und Entwicklung.

WEB-BASED , SIMULATION-ORIENTED TRAINING COURSES IN ELECTRONICS AND MICROSYSTEMS TECHNOLOGY

Jürgen Haufe, Peter Schneider, Günter Elst, 2004 .