Manfred Droste

Orcid: 0000-0001-9128-8844

Affiliations:
  • University of Leipzig, Germany
  • Dresden University of Technology, Germany


According to our database1, Manfred Droste authored at least 125 papers between 1983 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Weighted Linear Dynamic Logic.
Int. J. Found. Comput. Sci., 2024

2023
Special Issue: International Colloquium: Recent Advances of Quantitative Models in Computer Science (RAQM 2021) - Preface.
Int. J. Found. Comput. Sci., September, 2023

Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata.
Int. J. Found. Comput. Sci., September, 2023

2022
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids.
Theor. Comput. Sci., 2022

Preface.
Inf. Comput., 2022

Weighted operator precedence languages.
Inf. Comput., 2022

Greibach normal form for <i>ω</i>-algebraic systems and weighted simple <i>ω</i>-pushdown automata.
Inf. Comput., 2022

Logic for <i>ω</i>-pushdown automata.
Inf. Comput., 2022

2021
Weighted automata.
Proceedings of the Handbook of Automata Theory., 2021

2020
McCarthy-Kleene fuzzy automata and MSO logics.
Inf. Comput., 2020

Greibach Normal Form for ω-Algebraic Systems and Weighted Simple ω-Pushdown Automata.
CoRR, 2020

Nivat-Theorem and Logic for Weighted Pushdown Automata on Infinite Words.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable.
Proceedings of the Descriptional Complexity of Formal Systems, 2020

2019
Preface.
Theor. Comput. Sci., 2019

Weighted simple reset pushdown automata.
Theor. Comput. Sci., 2019

A Nivat theorem for weighted picture automata and weighted MSO logics.
J. Comput. Syst. Sci., 2019

Weighted automata with storage.
Inf. Comput., 2019

A Kleene theorem for weighted tree automata over tree valuation monoids.
Inf. Comput., 2019

Aperiodic Weighted Automata and Weighted First-Order Logic.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Greibach Normal Form for omega-Algebraic Systems and Weighted Simple omega-Pushdown Automata.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018
Weighted register automata and weighted logic on data words.
Theor. Comput. Sci., 2018

Preface: Dedicated to the memory of Zoltán Ésik (1951-2016).
Soft Comput., 2018

Weighted omega-Restricted One Counter Automata.
Log. Methods Comput. Sci., 2018

A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
Model checking of linear-time properties in multi-valued systems.
Inf. Sci., 2017

Weighted automata and logics for infinite nested words.
Inf. Comput., 2017

MK-fuzzy Automata and MSO Logics.
Proceedings of the Proceedings Eighth International Symposium on Games, 2017

The Triple-Pair Construction for Weighted ω-Pushdown Automata.
Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

Weigthed omega-Restricted One Counter Automata.
CoRR, 2017

A Kleene Theorem for Weighted ω-Pushdown Automata.
Acta Cybern., 2017

A Nivat Theorem for Quantitative Automata on Unranked Trees.
Proceedings of the Models, Algorithms, Logics and Tools, 2017

2016
Multi-weighted Automata and MSO Logic.
Theory Comput. Syst., 2016

Zoltán Ésik (1951 - 2016) - In Memoriam.
J. Autom. Lang. Comb., 2016

Weighted Linear Dynamic Logic.
Proceedings of the Seventh International Symposium on Games, 2016

A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem.
Proceedings of the Language and Automata Theory and Applications, 2016

2015
The Supports of Weighted Unranked Tree Automata.
Fundam. Informaticae, 2015

Weighted Automata and Logics on Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic.
Proceedings of the Language and Automata Theory and Applications, 2015

A Logical Characterization of Timed Pushdown Languages.
Proceedings of the Computer Science - Theory and Applications, 2015

Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics.
Proceedings of the Algebraic Informatics - 6th International Conference, 2015

Logics for Weighted Timed Pushdown Automata.
Proceedings of the Fields of Logic and Computation II, 2015

2014
Preface.
Theor. Comput. Sci., 2014

The Chomsky-SCHüTzenberger Theorem for Quantitative Context-Free Languages.
Int. J. Found. Comput. Sci., 2014

Weighted Nested Word Automata and Logics over Strong bimonoids.
Int. J. Found. Comput. Sci., 2014

Conway and iteration hemirings Part 2.
Int. J. Algebra Comput., 2014

Conway and iteration hemirings Part 1.
Int. J. Algebra Comput., 2014

A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Weighted finite automata over hemirings.
Theor. Comput. Sci., 2013

Conway and iteration hemirings.
CoRR, 2013

The support of nested weighted automata.
Proceedings of the Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13, 2013

2012
Weighted automata and multi-valued logics over arbitrary bounded lattices.
Theor. Comput. Sci., 2012

Weighted automata and weighted MSO logics for average and long-time behaviors.
Inf. Comput., 2012

Weighted Automata and Quantitative Logics.
Proceedings of the Quantitative Logic and Soft Computing, 2012

2011
A Kleene-Schützenberger theorem for weighted timed automata.
Theor. Comput. Sci., 2011

Weighted Logics for Unranked Tree Automata.
Theory Comput. Syst., 2011

Weighted Automata and Regular Expressions over Valuation Monoids.
Int. J. Found. Comput. Sci., 2011

A Cascade Decomposition of Weighted Finite Transition Systems.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics.
Proceedings of the Algebraic Foundations in Computer Science, 2011

2010
Weighted finite automata over strong bimonoids.
Inf. Sci., 2010

Determinization of weighted finite automata over strong bimonoids.
Inf. Sci., 2010

Bifinite Chu Spaces
Log. Methods Comput. Sci., 2010

Regular Expressions on Average and in the Long Run.
Proceedings of the Implementation and Application of Automata, 2010

Describing Average- and Longtime-Behavior by Weighted MSO Logics.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

10031 Executive Summary - Quantitative Models: Expressiveness and Analysis.
Proceedings of the Quantitative Models: Expressiveness and Analysis, 17.01. - 22.01.2010, 2010

10031 Abstracts Collection - Quantitative Models: Expressiveness and Analysis.
Proceedings of the Quantitative Models: Expressiveness and Analysis, 17.01. - 22.01.2010, 2010

2009
Weighted automata and weighted logics with discounting.
Theor. Comput. Sci., 2009

2008
Construction of Some Uncountable 2-Arc-Transitive Bipartite Graphs.
Order, 2008

On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables.
Theory Comput. Syst., 2008

Weighted automata with discounting.
Inf. Process. Lett., 2008

Random Event Structures.
Int. J. Softw. Informatics, 2008

Multi-Valued MSO Logics OverWords and Trees.
Fundam. Informaticae, 2008

A Monoidal Category of Bifinite Chu Spaces.
Proceedings of the First International Conference on Foundations of Informatics, 2008

2007
Weighted automata and weighted logics.
Theor. Comput. Sci., 2007

On Weighted BÜchi Automata with Order-Complete Weights.
Int. J. Algebra Comput., 2007

Almost Every Domain is Universal.
Proceedings of the 23rd Conference on the Mathematical Foundations of Programming Semantics, 2007

Normal Subgroups of B<sub> <i>u</i> </sub>Aut(Omega).
Appl. Categorical Struct., 2007

2006
Weighted tree automata and weighted logics.
Theor. Comput. Sci., 2006

Skew and infinitary formal power series.
Theor. Comput. Sci., 2006

Observations on the Smoothness Properties of Real Functions Computed by Weighted Finite Automata.
Fundam. Informaticae, 2006

Weighted Automata and Weighted Logics on Infinite Words.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005
A Kleene Theorem for Weighted Tree Automata.
Theory Comput. Syst., 2005

2003
On random relational structures.
J. Comb. Theory, Ser. A, 2003

Editorial.
J. Autom. Lang. Comb., 2003

On transformations of formal power series.
Inf. Comput., 2003

2002
Universal Homogeneous Graph-Like Structures And Domains.
Math. Struct. Comput. Sci., 2002

Uncountable Homogeneous Partial Orders.
Math. Log. Q., 2002

Editorial.
J. Autom. Lang. Comb., 2002

From Petri Nets to Automata with Concurrency.
Appl. Categorical Struct., 2002

2001
Recognizable languages in divisibility monoids.
Math. Struct. Comput. Sci., 2001

Rational Transformations of Formal Power Series.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Continuous Petri Nets and Transition Systems.
Proceedings of the Unifying Petri Nets, Advances in Petri Nets, 2001

2000
Asynchronous cellular automata for pomsets.
Theor. Comput. Sci., 2000

1999
On Homogeneous Semilattices and Their Automorphism Groups.
Order, 1999

The Kleene-Schützenberger Theorem for Formal Power Series in Partially Commuting Variables.
Inf. Comput., 1999

1998
Recognizable and Logically Definable Languages of Infinite Computations in Concurrent Automata.
Int. J. Found. Comput. Sci., 1998

1997
Representation of Computations in Concurrent Automata by Dependence Orders.
Theor. Comput. Sci., 1997

On Recognizable and Rational Formal Power Series in Partially Commuting Variables.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
Aperiodic Languages in Concurrency Monoids.
Inf. Comput., 1996

Asynchronous Cellular Automata for Pomsets Without Auto-concurrency.
Proceedings of the CONCUR '96, 1996

1995
Recognizable Languages in Concurrency Monoids.
Theor. Comput. Sci., 1995

Periodic Ordered Permutation Groups and Cyclic Orderings.
J. Comb. Theory, Ser. B, 1995

Dependence Orders for Computations of Concurrent Automata.
Proceedings of the STACS 95, 1995

Trace Languages Definable with Modular Quantifiers.
Proceedings of the Developments in Language Theory II, 1995

Languages and Logical Definability in Concurrency Monoids.
Proceedings of the Computer Science Logic, 9th International Workshop, 1995

1994
Labelled Domains and Automata with Concurrency.
Theor. Comput. Sci., 1994

Set-Homogeneous Graphs.
J. Comb. Theory, Ser. B, 1994

A KLeene Theorem for Recognizable Languages over Concurrency Monoids.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993
On Stable Domains.
Theor. Comput. Sci., 1993

Universal Domains and the Amalgamation Property.
Math. Struct. Comput. Sci., 1993

From Domains to Automata with Concurrency.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992
Finite Axiomatizations for Universal Domains.
J. Log. Comput., 1992

Concurrent Automata and Domains.
Int. J. Found. Comput. Sci., 1992

Bounded Petri nets of finite dimension have only finitely many reachable markings.
Bull. EATCS, 1992

1991
Universal Homogeneous Event Structures and Domains
Inf. Comput., September, 1991

On <i>k</i>-homogeneous posets and graphs.
J. Comb. Theory, Ser. A, 1991

1990
Non-Deterministic Information Systems and their Domains.
Theor. Comput. Sci., 1990

Universal Information Systems.
Int. J. Found. Comput. Sci., 1990

Universal Domains in the Theory of Denotational Semantics of Programming Languages
Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

Concurrency, Automata and Domains.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989
Recursive Domain Equations for Concrete Data Structures
Inf. Comput., July, 1989

Event Structures and Domains.
Theor. Comput. Sci., 1989

Effectively Given Information Systems and Domains.
Proceedings of the CSL '89, 1989

1987
Completeness Properties of Certain Normal Subgroup Lattices.
Eur. J. Comb., 1987

1983
Products of conjugacy classes of the infinite symmetric groups.
Discret. Math., 1983


  Loading...