| 2008 |
| 60 | EE | Manfred Droste,
Karin Quaas:
A Kleene-Schützenberger Theorem for Weighted Timed Automata.
FoSSaCS 2008: 142-156 |
| 59 | EE | Fang-Ping Huang,
Manfred Droste,
Guo-Qiang Zhang:
A Monoidal Category of Bifinite Chu Spaces.
Electr. Notes Theor. Comput. Sci. 212: 285-297 (2008) |
| 58 | EE | Manfred Droste,
Werner Kuich,
George Rahonis:
Multi-Valued MSO Logics OverWords and Trees.
Fundam. Inform. 84(3-4): 305-327 (2008) |
| 57 | EE | Manfred Droste,
Jacques Sakarovitch,
Heiko Vogler:
Weighted automata with discounting.
Inf. Process. Lett. 108(1): 23-28 (2008) |
| 56 | EE | Manfred Droste,
Paul Gastin:
On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables.
Theory Comput. Syst. 42(4): 608-631 (2008) |
| 2007 |
| 55 | EE | Manfred Droste,
Guo-Qiang Zhang:
Bifinite Chu Spaces.
CAI 2007: 73-74 |
| 54 | EE | Manfred Droste,
Guo-Qiang Zhang:
Bifinite Chu Spaces.
CALCO 2007: 179-193 |
| 53 | EE | Manfred Droste,
George Rahonis:
Weighted Automata and Weighted Logics with Discounting.
CIAA 2007: 73-84 |
| 52 | EE | Manfred Droste,
W. Charles Holland:
Normal Subgroups of B u Aut(Omega).
Applied Categorical Structures 15(1-2): 153-162 (2007) |
| 51 | EE | Manfred Droste,
Dietrich Kuske:
Almost Every Domain is Universal.
Electr. Notes Theor. Comput. Sci. 173: 103-119 (2007) |
| 50 | EE | Manfred Droste,
Ulrike Püschmann:
On Weighted BÜchi Automata with Order-Complete Weights.
IJAC 17(2): 235-260 (2007) |
| 49 | EE | Manfred Droste,
Paul Gastin:
Weighted automata and weighted logics.
Theor. Comput. Sci. 380(1-2): 69-86 (2007) |
| 2006 |
| 48 | EE | Manfred Droste,
George Rahonis:
Weighted Automata and Weighted Logics on Infinite Words.
Developments in Language Theory 2006: 49-58 |
| 47 | EE | Manfred Droste,
Jarkko Kari,
Paula Steinby:
Observations on the Smoothness Properties of Real Functions Computed by Weighted Finite Automata.
Fundam. Inform. 73(1-2): 99-106 (2006) |
| 46 | EE | Manfred Droste,
Dietrich Kuske:
Skew and infinitary formal power series.
Theor. Comput. Sci. 366(3): 199-227 (2006) |
| 45 | EE | Manfred Droste,
Heiko Vogler:
Weighted tree automata and weighted logics.
Theor. Comput. Sci. 366(3): 228-247 (2006) |
| 2005 |
| 44 | EE | Manfred Droste,
Paul Gastin:
Weighted Automata and Weighted Logics.
ICALP 2005: 513-525 |
| 43 | EE | Manfred Droste,
Christian Pech,
Heiko Vogler:
A Kleene Theorem for Weighted Tree Automata.
Theory Comput. Syst. 38(1): 1-38 (2005) |
| 2003 |
| 42 | EE | Manfred Droste,
Dietrich Kuske:
Skew and Infinitary Formal Power Series.
ICALP 2003: 426-438 |
| 41 | EE | Manfred Droste,
Guo-Qiang Zhang:
On transformations of formal power series.
Inf. Comput. 184(2): 369-383 (2003) |
| 40 | EE | Manfred Droste,
Dietrich Kuske:
On random relational structures.
J. Comb. Theory, Ser. A 102(2): 241-254 (2003) |
| 39 | | Manfred Droste,
Heiko Vogler:
Editorial.
Journal of Automata, Languages and Combinatorics 8(2): 115 (2003) |
| 2002 |
| 38 | EE | Manfred Droste,
R. M. Shortt:
From Petri Nets to Automata with Concurrency.
Applied Categorical Structures 10(2): 173-191 (2002) |
| 37 | EE | Manfred Droste,
Dugald Macpherson,
Alan Mekler:
Uncountable Homogeneous Partial Orders.
Math. Log. Q. 48(4): 525-532 (2002) |
| 36 | | Paolo Boldi,
Felice Cardone,
Manfred Droste:
Universal Homogeneous Graph-Like Structures And Domains.
Mathematical Structures in Computer Science 12(1): 91-109 (2002) |
| 2001 |
| 35 | EE | Manfred Droste,
Guo-Qiang Zhang:
Rational Transformations of Formal Power Series.
ICALP 2001: 555-566 |
| 34 | EE | Manfred Droste,
R. M. Shortt:
Continuous Petri Nets and Transition Systems.
Unifying Petri Nets 2001: 457-484 |
| 33 | | Manfred Droste,
Dietrich Kuske:
Recognizable languages in divisibility monoids.
Mathematical Structures in Computer Science 11(6): 743-770 (2001) |
| 2000 |
| 32 | EE | Manfred Droste,
Paul Gastin,
Dietrich Kuske:
Asynchronous cellular automata for pomsets.
Theor. Comput. Sci. 247(1-2): 1-38 (2000) |
| 1999 |
| 31 | EE | Manfred Droste,
Dietrich Kuske:
On Recognizable Languages in Divisibility Monoids.
FCT 1999: 246-257 |
| 30 | | Manfred Droste,
Paul Gastin:
The Kleene-Schützenberger Theorem for Formal Power Series in Partially Commuting Variables.
Inf. Comput. 153(1): 47-80 (1999) |
| 1998 |
| 29 | | Manfred Droste,
Dietrich Kuske:
Recognizable and Logically Definable Languages of Infinite Computations in Concurrent Automata.
Int. J. Found. Comput. Sci. 9(3): 295-314 (1998) |
| 1997 |
| 28 | | Manfred Droste,
Paul Gastin:
On Recognizable and Rational Formal Power Series in Partially Commuting Variables.
ICALP 1997: 682-692 |
| 27 | EE | Felipe Bracho,
Manfred Droste,
Dietrich Kuske:
Representation of Computations in Concurrent Automata by Dependence Orders.
Theor. Comput. Sci. 174(1-2): 67-96 (1997) |
| 1996 |
| 26 | | Manfred Droste,
Paul Gastin:
Asynchronous Cellular Automata for Pomsets Without Auto-concurrency.
CONCUR 1996: 627-638 |
| 25 | | Manfred Droste:
Aperiodic Languages in Concurrency Monoids.
Inf. Comput. 126(2): 105-113 (1996) |
| 1995 |
| 24 | | Manfred Droste,
Dietrich Kuske:
Languages and Logical Definability in Concurrency Monoids.
CSL 1995: 233-251 |
| 23 | | Manfred Droste,
Dietrich Kuske:
Trace Languages Definable with Modular Quantifiers.
Developments in Language Theory 1995: 386-395 |
| 22 | | Felipe Bracho,
Manfred Droste,
Dietrich Kuske:
Dependence Orders for Computations of Concurrent Automata.
STACS 1995: 467-478 |
| 21 | EE | Manfred Droste,
Michèle Giraudet,
Dugald Macpherson:
Periodic Ordered Permutation Groups and Cyclic Orderings.
J. Comb. Theory, Ser. B 63(2): 310-321 (1995) |
| 20 | EE | Manfred Droste:
Recognizable Languages in Concurrency Monoids.
Theor. Comput. Sci. 150(1): 77-109 (1995) |
| 1994 |
| 19 | | Manfred Droste:
A KLeene Theorem for Recognizable Languages over Concurrency Monoids.
ICALP 1994: 388-399 |
| 18 | EE | Manfred Droste,
Dugald Macpherson,
Norbert Sauer,
Michèle Giraudet:
Set-Homogeneous Graphs.
J. Comb. Theory, Ser. B 62(1): 63-95 (1994) |
| 17 | | Felipe Bracho,
Manfred Droste:
Labelled Domains and Automata with Concurrency.
Theor. Comput. Sci. 135(2): 289-318 (1994) |
| 1993 |
| 16 | | Felipe Bracho,
Manfred Droste:
From Domains to Automata with Concurrency.
ICALP 1993: 669-681 |
| 15 | | Manfred Droste,
Rüdiger Göbel:
Universal Domains and the Amalgamation Property.
Mathematical Structures in Computer Science 3(2): 137-159 (1993) |
| 14 | | Manfred Droste:
On Stable Domains.
Theor. Comput. Sci. 111(1&2): 89-101 (1993) |
| 1992 |
| 13 | | Manfred Droste,
R. M. Shortt:
Bounded Petri nets of finite dimension have only finitely many reachable markings.
Bulletin of the EATCS 48: 172-174 (1992) |
| 12 | | Manfred Droste:
Concurrent Automata and Domains.
Int. J. Found. Comput. Sci. 3(4): 389-418 (1992) |
| 11 | | Manfred Droste:
Finite Axiomatizations for Universal Domains.
J. Log. Comput. 2(2): 119-131 (1992) |
| 1991 |
| 10 | | Manfred Droste:
Universal Homogeneous Event Structures and Domains
Inf. Comput. 94(1): 48-61 (1991) |
| 9 | EE | Manfred Droste,
Dugald Macpherson:
On k-homogeneous posets and graphs.
J. Comb. Theory, Ser. A 56(1): 1-15 (1991) |
| 1990 |
| 8 | | Manfred Droste:
Concurrency, Automata and Domains.
ICALP 1990: 195-208 |
| 7 | | Manfred Droste,
Rüdiger Göbel:
Universal Domains in the Theory of Denotational Semantics of Programming Languages
LICS 1990: 19-34 |
| 6 | | Manfred Droste,
Rüdiger Göbel:
Universal Information Systems.
Int. J. Found. Comput. Sci. 1(4): 413-424 (1990) |
| 5 | | Manfred Droste,
Rüdiger Göbel:
Non-Deterministic Information Systems and their Domains.
Theor. Comput. Sci. 75(3): 289-309 (1990) |
| 1989 |
| 4 | | Manfred Droste,
Rüdiger Göbel:
Effectively Given Information Systems and Domains.
CSL 1989: 116-142 |
| 3 | | Manfred Droste:
Recursive Domain Equations for Concrete Data Structures
Inf. Comput. 82(1): 65-80 (1989) |
| 2 | | Manfred Droste:
Event Structures and Domains.
Theor. Comput. Sci. 68(1): 37-47 (1989) |
| 1983 |
| 1 | EE | Manfred Droste:
Products of conjugacy classes of the infinite symmetric groups.
Discrete Mathematics 47: 35-48 (1983) |