( en | de | ru )

 

Disambiguation of "Droste, Manfred"

Author of the publication

copydeleteadd this publication to your clipboard
Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable.

, , , and . DCFS, volume 12442 of Lecture Notes in Computer Science, page 39-51. Springer, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Manfred Droste

Manfred Droste

Manfred Droste

Manfred Droste

Manfred Droste

 

Other publications of authors with the same name

Weighted Automata and Quantitative Logics.. QLSC, volume 5 of World Scientific Proceedings Series on Computer Engineering and Informtion Science, World Scientific, (2012)Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids., , , and . CoRR, (2021)Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics., , , and . Algebraic Foundations in Computer Science, volume 7020 of Lecture Notes in Computer Science, page 30-55. Springer, (2011)The Kleene-Schützenberger Theorem for Formal Power Series in Partially Commuting Variables., and . Inf. Comput., 153 (1): 47-80 (1999)10031 Executive Summary - Quantitative Models: Expressiveness and Analysis., , , and . Quantitative Models: Expressiveness and Analysis, volume 10031 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)Weighted automata and weighted logics., and . Theor. Comput. Sci., 380 (1-2): 69-86 (2007)Weighted finite automata over hemirings., and . Theor. Comput. Sci., (2013)Completeness Properties of Certain Normal Subgroup Lattices.. Eur. J. Comb., 8 (2): 129-137 (1987)Continuous Petri Nets and Transition Systems., and . Unifying Petri Nets, volume 2128 of Lecture Notes in Computer Science, page 457-484. Springer, (2001)Concurrency, Automata and Domains.. ICALP, volume 443 of Lecture Notes in Computer Science, page 195-208. Springer, (1990)