Manfred Droste
Orcid: 0000-0001-9128-8844Affiliations:
- University of Leipzig, Germany
- Dresden University of Technology, Germany
According to our database1,
Manfred Droste
authored at least 130 papers
between 1983 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on andrej.com
On csauthors.net:
Bibliography
2024
Undecidability of the universal support problem for weighted automata over zero-sum-free commutative semirings.
Theor. Comput. Sci., 2024
CoRR, 2024
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024
2023
Special Issue: International Colloquium: Recent Advances of Quantitative Models in Computer Science (RAQM 2021) - Preface.
Int. J. Found. Comput. Sci., September, 2023
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
Int. J. Found. Comput. Sci., 2022
Greibach normal form for <i>ω</i>-algebraic systems and weighted simple <i>ω</i>-pushdown automata.
Inf. Comput., 2022
2021
2020
Greibach Normal Form for ω-Algebraic Systems and Weighted Simple ω-Pushdown Automata.
CoRR, 2020
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
J. Comput. Syst. Sci., 2019
Inf. Comput., 2019
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
Theor. Comput. Sci., 2018
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018
2017
Proceedings of the Proceedings Eighth International Symposium on Games, 2017
Proceedings of the Models, Algorithms, Logics and Tools, 2017
2016
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
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015
Proceedings of the Language and Automata Theory and Applications, 2015
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
Proceedings of the Fields of Logic and Computation II, 2015
2014
Int. J. Found. Comput. Sci., 2014
Int. J. Found. Comput. Sci., 2014
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014
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
Theor. Comput. Sci., 2012
Inf. Comput., 2012
Proceedings of the Quantitative Logic and Soft Computing, 2012
2011
Theor. Comput. Sci., 2011
Int. J. Found. Comput. Sci., 2011
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
Proceedings of the Implementation and Application of Automata, 2010
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
Proceedings of the Quantitative Models: Expressiveness and Analysis, 17.01. - 22.01.2010, 2010
Proceedings of the Quantitative Models: Expressiveness and Analysis, 17.01. - 22.01.2010, 2010
2009
2008
Theory Comput. Syst., 2008
Proceedings of the First International Conference on Foundations of Informatics, 2008
2007
Int. J. Algebra Comput., 2007
Proceedings of the 23rd Conference on the Mathematical Foundations of Programming Semantics, 2007
Appl. Categorical Struct., 2007
2006
Observations on the Smoothness Properties of Real Functions Computed by Weighted Finite Automata.
Fundam. Informaticae, 2006
Proceedings of the Developments in Language Theory, 10th International Conference, 2006
2005
2003
2002
Math. Struct. Comput. Sci., 2002
2001
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001
Proceedings of the Unifying Petri Nets, Advances in Petri Nets, 2001
2000
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
Theor. Comput. Sci., 1997
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997
1996
Proceedings of the CONCUR '96, 1996
1995
Proceedings of the STACS 95, 1995
Trace Languages Definable with Modular Quantifiers.
Proceedings of the Developments in Language Theory II, 1995
Proceedings of the Computer Science Logic, 9th International Workshop, 1995
1994
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994
1993
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993
1992
Bounded Petri nets of finite dimension have only finitely many reachable markings.
Bull. EATCS, 1992
1991
1990
Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990
1989
1987
1983