Products of conjugacy classes of the infinite symmetric groups. - Manfred Droste (Discret. Math., 1983)

Completeness Properties of Certain Normal Subgroup Lattices. - Manfred Droste (Eur. J. Comb., 1987)

Effectively Given Information Systems and Domains. - Manfred Droste; Rüdiger Göbel (CSL, 1989)

Event Structures and Domains. - Manfred Droste (Theor. Comput. Sci., 1989)

Recursive Domain Equations for Concrete Data Structures - Manfred Droste (Inf. Comput., 1989)

Concurrency, Automata and Domains. - Manfred Droste (ICALP, 1990)

Universal Domains in the Theory of Denotational Semantics of Programming Languages - Manfred Droste; Rüdiger Göbel (LICS, 1990)

Universal Information Systems. - Manfred Droste; Rüdiger Göbel (Int. J. Found. Comput. Sci., 1990)

Non-Deterministic Information Systems and their Domains. - Manfred Droste; Rüdiger Göbel (Theor. Comput. Sci., 1990)

On k-homogeneous posets and graphs. - Manfred Droste; Dugald Macpherson (J. Comb. Theory A, 1991)

Universal Homogeneous Event Structures and Domains - Manfred Droste (Inf. Comput., 1991)

Bounded Petri nets of finite dimension have only finitely many reachable markings. - Manfred Droste; R. M. Shortt (Bull. EATCS, 1992)

Concurrent Automata and Domains. - Manfred Droste (Int. J. Found. Comput. Sci., 1992)

Finite Axiomatizations for Universal Domains. - Manfred Droste (J. Log. Comput., 1992)

From Domains to Automata with Concurrency. - Felipe Bracho; Manfred Droste (ICALP, 1993)

Universal Domains and the Amalgamation Property. - Manfred Droste; Rüdiger Göbel (Math. Struct. Comput. Sci., 1993)

On Stable Domains. - Manfred Droste (Theor. Comput. Sci., 1993)

A KLeene Theorem for Recognizable Languages over Concurrency Monoids. - Manfred Droste (ICALP, 1994)

Set-Homogeneous Graphs. - Manfred Droste; Dugald Macpherson; Norbert Sauer; Michèle Giraudet (J. Comb. Theory B, 1994)

Labelled Domains and Automata with Concurrency. - Felipe Bracho; Manfred Droste (Theor. Comput. Sci., 1994)

Languages and Logical Definability in Concurrency Monoids. - Manfred Droste; Dietrich Kuske (CSL, 1995)

Trace Languages Definable with Modular Quantifiers. - Manfred Droste; Dietrich Kuske (Developments in Language Theory, 1995)

Dependence Orders for Computations of Concurrent Automata. - Felipe Bracho; Manfred Droste; Dietrich Kuske (STACS, 1995)

Periodic Ordered Permutation Groups and Cyclic Orderings. - Manfred Droste; Michèle Giraudet; Dugald Macpherson (J. Comb. Theory B, 1995)

Recognizable Languages in Concurrency Monoids. - Manfred Droste (Theor. Comput. Sci., 1995)

Asynchronous Cellular Automata for Pomsets Without Auto-concurrency. - Manfred Droste; Paul Gastin (CONCUR, 1996)

Aperiodic Languages in Concurrency Monoids. - Manfred Droste (Inf. Comput., 1996)

On Recognizable and Rational Formal Power Series in Partially Commuting Variables. - Manfred Droste; Paul Gastin (ICALP, 1997)

Representation of Computations in Concurrent Automata by Dependence Orders. - Felipe Bracho; Manfred Droste; Dietrich Kuske (Theor. Comput. Sci., 1997)

Recognizable and Logically Definable Languages of Infinite Computations in Concurrent Automata. - Manfred Droste; Dietrich Kuske (Int. J. Found. Comput. Sci., 1998)

The Kleene-Schützenberger Theorem for Formal Power Series in Partially Commuting Variables. - Manfred Droste; Paul Gastin (Inf. Comput., 1999)

On Homogeneous Semilattices and Their Automorphism Groups. - Manfred Droste; Dietrich Kuske; John Kenneth Truss (Order, 1999)

Asynchronous cellular automata for pomsets. - Manfred Droste; Paul Gastin; Dietrich Kuske (Theor. Comput. Sci., 2000)

Continuous Petri Nets and Transition Systems. - Manfred Droste; R. M. Shortt (Unifying Petri Nets, 2001)

Rational Transformations of Formal Power Series. - Manfred Droste; Guo-Qiang Zhang 001 (ICALP, 2001)

Recognizable languages in divisibility monoids. - Manfred Droste; Dietrich Kuske (Math. Struct. Comput. Sci., 2001)

From Petri Nets to Automata with Concurrency. - Manfred Droste; R. M. Shortt (Appl. Categorical Struct., 2002)

Editorial. - Manfred Droste; Paul Gastin (J. Autom. Lang. Comb., 2002)

Uncountable Homogeneous Partial Orders. - Manfred Droste; Dugald Macpherson; Alan H. Mekler (Math. Log. Q., 2002)

Universal Homogeneous Graph-Like Structures And Domains. - Paolo Boldi; Felice Cardone; Manfred Droste (Math. Struct. Comput. Sci., 2002)

On transformations of formal power series. - Manfred Droste; Guo-Qiang Zhang 001 (Inf. Comput., 2003)

Editorial. - Manfred Droste; Heiko Vogler (J. Autom. Lang. Comb., 2003)

On random relational structures. - Manfred Droste; Dietrich Kuske (J. Comb. Theory A, 2003)

A Kleene Theorem for Weighted Tree Automata. - Manfred Droste; Christian Pech; Heiko Vogler (Theory Comput. Syst., 2005)

Weighted Automata and Weighted Logics on Infinite Words. - Manfred Droste; George Rahonis (Developments in Language Theory, 2006)

Observations on the Smoothness Properties of Real Functions Computed by Weighted Finite Automata. - Manfred Droste; Jarkko Kari; Paula Steinby (Fundam. Informaticae, 2006)

Skew and infinitary formal power series. - Manfred Droste; Dietrich Kuske (Theor. Comput. Sci., 2006)

Weighted tree automata and weighted logics. - Manfred Droste; Heiko Vogler (Theor. Comput. Sci., 2006)

Normal Subgroups of B u Aut(Omega). - Manfred Droste; W. Charles Holland (Appl. Categorical Struct., 2007)

Almost Every Domain is Universal. - Manfred Droste; Dietrich Kuske (MFPS, 2007)

On Weighted BÜchi Automata with Order-Complete Weights. - Manfred Droste; Ulrike Püschmann (Int. J. Algebra Comput., 2007)

Weighted automata and weighted logics. - Manfred Droste; Paul Gastin (Theor. Comput. Sci., 2007)

A Monoidal Category of Bifinite Chu Spaces. - Fangping Huang; Manfred Droste; Guo-Qiang Zhang 001 (FICS, 2008)

Multi-Valued MSO Logics OverWords and Trees. - Manfred Droste; Werner Kuich; George Rahonis (Fundam. Informaticae, 2008)

Random Event Structures. - Manfred Droste; Guo-Qiang Zhang 001 (Int. J. Softw. Informatics, 2008)

Weighted automata with discounting. - Manfred Droste; Jacques Sakarovitch; Heiko Vogler (Inf. Process. Lett., 2008)

On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables. - Manfred Droste; Paul Gastin (Theory Comput. Syst., 2008)

Construction of Some Uncountable 2-Arc-Transitive Bipartite Graphs. - Manfred Droste; Robert Gray; John Kenneth Truss (Order, 2008)

Weighted automata and weighted logics with discounting. - Manfred Droste; George Rahonis (Theor. Comput. Sci., 2009)

10031 Abstracts Collection - Quantitative Models: Expressiveness and Analysis. - Christel Baier; Manfred Droste; Paul Gastin; Kim Guldstrand Larsen (Quantitative Models: Expressiveness and Analysis, 2010)

10031 Executive Summary - Quantitative Models: Expressiveness and Analysis. - Christel Baier; Manfred Droste; Paul Gastin; Kim Guldstrand Larsen (Quantitative Models: Expressiveness and Analysis, 2010)

Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices. - Manfred Droste; Heiko Vogler (Developments in Language Theory, 2010)

Describing Average- and Longtime-Behavior by Weighted MSO Logics. - Manfred Droste; Ingmar Meinecke (MFCS, 2010)

Regular Expressions on Average and in the Long Run. - Manfred Droste; Ingmar Meinecke (CIAA, 2010)

Bifinite Chu Spaces - Manfred Droste; Guo-Qiang Zhang 001 (Log. Methods Comput. Sci., 2010)

Determinization of weighted finite automata over strong bimonoids. - Miroslav Ciric 001; Manfred Droste; Jelena Ignjatovic; Heiko Vogler (Inf. Sci., 2010)

Weighted finite automata over strong bimonoids. - Manfred Droste; Torsten Stüber; Heiko Vogler (Inf. Sci., 2010)

Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics. - Manfred Droste; Doreen Götze; Steffen Märcker; Ingmar Meinecke (Algebraic Foundations in Computer Science, 2011)

A Cascade Decomposition of Weighted Finite Transition Systems. - Manfred Droste; Ingmar Meinecke; Branimir Seselja; Andreja Tepavcevic (Developments in Language Theory, 2011)

Weighted Automata and Regular Expressions over Valuation Monoids. - Manfred Droste; Ingmar Meinecke (Int. J. Found. Comput. Sci., 2011)

Weighted Logics for Unranked Tree Automata. - Manfred Droste; Heiko Vogler (Theory Comput. Syst., 2011)

A Kleene-Schützenberger theorem for weighted timed automata. - Manfred Droste; Karin Quaas (Theor. Comput. Sci., 2011)

Weighted Automata and Quantitative Logics. - Manfred Droste (QLSC, 2012)

Weighted automata and weighted MSO logics for average and long-time behaviors. - Manfred Droste; Ingmar Meinecke (Inf. Comput., 2012)

Weighted automata and multi-valued logics over arbitrary bounded lattices. - Manfred Droste; Heiko Vogler (Theor. Comput. Sci., 2012)

The support of nested weighted automata. - Manfred Droste; Doreen Götze (NCMA, 2013)

Conway and iteration hemirings. - Manfred Droste; Zoltán Ésik; Werner Kuich (CoRR, 2013)

Weighted finite automata over hemirings. - Manfred Droste; Werner Kuich (Theor. Comput. Sci., 2013)

A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic. - Manfred Droste; Vitaly Perevoshchikov (ICALP (2), 2014)

Conway and iteration hemirings Part 1. - Manfred Droste; Zoltán Ésik; Werner Kuich (Int. J. Algebra Comput., 2014)

Conway and iteration hemirings Part 2. - Manfred Droste; Zoltán Ésik; Werner Kuich (Int. J. Algebra Comput., 2014)

Weighted Nested Word Automata and Logics over Strong bimonoids. - Manfred Droste; Bundit Pibaljommee (Int. J. Found. Comput. Sci., 2014)

The Chomsky-SCHüTzenberger Theorem for Quantitative Context-Free Languages. - Manfred Droste; Heiko Vogler (Int. J. Found. Comput. Sci., 2014)

Preface. - Manfred Droste; Heiko Vogler (Theor. Comput. Sci., 2014)

Logics for Weighted Timed Pushdown Automata. - Manfred Droste; Vitaly Perevoshchikov (Fields of Logic and Computation II, 2015)

Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics. - Manfred Droste; Doreen Heusel; Heiko Vogler (CAI, 2015)

A Logical Characterization of Timed Pushdown Languages. - Manfred Droste; Vitaly Perevoshchikov (CSR, 2015)

A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic. - Parvaneh Babari; Manfred Droste (LATA, 2015)

Weighted Automata and Logics on Graphs. - Manfred Droste; Stefan Dück (MFCS (1), 2015)

The Supports of Weighted Unranked Tree Automata. - Manfred Droste; Doreen Heusel (Fundam. Informaticae, 2015)

A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem. - Heiko Vogler; Manfred Droste; Luisa Herrmann 001 (LATA, 2016)

Weighted Linear Dynamic Logic. - Manfred Droste; George Rahonis (GandALF, 2016)

Zoltán Ésik (1951 - 2016) - In Memoriam. - Werner Kuich; Manfred Droste (J. Autom. Lang. Comb., 2016)

Multi-weighted Automata and MSO Logic. - Manfred Droste; Vitaly Perevoshchikov (Theory Comput. Syst., 2016)

A Nivat Theorem for Quantitative Automata on Unranked Trees. - Manfred Droste; Doreen Götze (Models, Algorithms, Logics and Tools, 2017)

A Kleene Theorem for Weighted ω-Pushdown Automata. - Manfred Droste; Werner Kuich (Acta Cybern., 2017)

Weigthed omega-Restricted One Counter Automata. - Manfred Droste; Werner Kuich (CoRR, 2017)

MK-fuzzy Automata and MSO Logics. - Manfred Droste; Temur Kutsia; George Rahonis; Wolfgang Schreiner (GandALF, 2017)

Weighted automata and logics for infinite nested words. - Manfred Droste; Stefan Dück (Inf. Comput., 2017)

Model checking of linear-time properties in multi-valued systems. - Yongming Li 001; Manfred Droste; Lihui Lei (Inf. Sci., 2017)

A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic. - Manfred Droste; Erik Paul (MFCS, 2018)

Weighted omega-Restricted One Counter Automata. - Manfred Droste; Werner Kuich (Log. Methods Comput. Sci., 2018)

Preface: Dedicated to the memory of Zoltán Ésik (1951-2016). - Manfred Droste; Kim G. Larsen (Soft Comput., 2018)

Weighted register automata and weighted logic on data words. - Parvaneh Babari; Manfred Droste; Vitaly Perevoshchikov (Theor. Comput. Sci., 2018)

Greibach Normal Form for omega-Algebraic Systems and Weighted Simple omega-Pushdown Automata. - Manfred Droste; Sven Dziadek; Werner Kuich (FSTTCS, 2019)

Aperiodic Weighted Automata and Weighted First-Order Logic. - Manfred Droste; Paul Gastin (MFCS, 2019)

A Kleene theorem for weighted tree automata over tree valuation monoids. - Doreen Götze; Zoltán Fülöp 001; Manfred Droste (Inf. Comput., 2019)

Weighted automata with storage. - Luisa Herrmann 001; Heiko Vogler; Manfred Droste (Inf. Comput., 2019)

A Nivat theorem for weighted picture automata and weighted MSO logics. - Parvaneh Babari; Manfred Droste (J. Comput. Syst. Sci., 2019)

Weighted simple reset pushdown automata. - Manfred Droste; Sven Dziadek; Werner Kuich (Theor. Comput. Sci., 2019)

Preface. - Manfred Droste; Ilias S. Kotsireas; Robert Rolland (Theor. Comput. Sci., 2019)

Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable. - Manfred Droste; Zoltán Fülöp 001; Dávid Kószó; Heiko Vogler (DCFS, 2020)

Nivat-Theorem and Logic for Weighted Pushdown Automata on Infinite Words. - Manfred Droste; Sven Dziadek; Werner Kuich (FSTTCS, 2020)

Greibach Normal Form for ω-Algebraic Systems and Weighted Simple ω-Pushdown Automata. - Manfred Droste; Sven Dziadek; Werner Kuich (CoRR, 2020)

McCarthy-Kleene fuzzy automata and MSO logics. - Manfred Droste; Temur Kutsia; George Rahonis; Wolfgang Schreiner (Inf. Comput., 2020)

Weighted automata. - Manfred Droste; Dietrich Kuske (Handbook of Automata Theory (I.), 2021)

Logic for ω-pushdown automata. - Manfred Droste; Sven Dziadek; Werner Kuich (Inf. Comput., 2022)

Greibach normal form for ω-algebraic systems and weighted simple ω-pushdown automata. - Manfred Droste; Sven Dziadek; Werner Kuich (Inf. Comput., 2022)

Weighted operator precedence languages. - Manfred Droste; Stefan Dück; Dino Mandrioli; Matteo Pradella (Inf. Comput., 2022)

Preface. - Manfred Droste; Andreas Maletti; Heiko Vogler (Inf. Comput., 2022)

The Triple-Pair Construction for Weighted ω-Pushdown Automata. - Manfred Droste; Zoltán Ésik; Werner Kuich (Int. J. Found. Comput. Sci., 2022)

Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids. - Manfred Droste; Zoltán Fülöp 001; Dávid Kószó; Heiko Vogler (Theor. Comput. Sci., 2022)

Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata. - Manfred Droste; Zoltán Fülöp 001; Dávid Kószó (Int. J. Found. Comput. Sci., 2023)

Special Issue: International Colloquium: Recent Advances of Quantitative Models in Computer Science (RAQM 2021) - Preface. - Manfred Droste; George Rahonis; Arto Salomaa (Int. J. Found. Comput. Sci., 2023)

Logical Characterizations of Weighted Complexity Classes. - Guillermo Badia; Manfred Droste; Carles Noguera; Erik Paul (MFCS, 2024)

The generating power of weighted tree automata with initial algebra semantics. - Manfred Droste; Zoltán Fülöp 001; Andreja Tepavcevic; Heiko Vogler (CoRR, 2024)

Run supports and initial algebra supports of weighted automata. - Manfred Droste; Heiko Vogler (CoRR, 2024)

Preface. - Miroslav Ciric 001; Manfred Droste; Jean-Éric Pin (Inf. Comput., 2024)

Weighted Linear Dynamic Logic. - Manfred Droste; Gustav Grabolle; George Rahonis (Int. J. Found. Comput. Sci., 2024)

Undecidability of the universal support problem for weighted automata over zero-sum-free commutative semirings. - Manfred Droste; Werner Kuich (Theor. Comput. Sci., 2024)

Special issue on 10th international workshop Weighted Automata: Theory and Applications (WATA 2020). - Manfred Droste; Paul Gastin; Benjamin Monmege (Inf. Comput., 2025)

Fagin's Theorem for Semiring Turing Machines. - Guillermo Badia; Manfred Droste; Thomas Eiter; Rafael Kiesel; Carles Noguera; Erik Paul (CoRR, 2025)