( 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 weighted MSO logics for average and long-time behaviors., and . Inf. Comput., (2012)Recursive Domain Equations for Concrete Data Structures. Inf. Comput., 82 (1): 65-80 (July 1989)A Cascade Decomposition of Weighted Finite Transition Systems., , , and . Developments in Language Theory, volume 6795 of Lecture Notes in Computer Science, page 472-473. Springer, (2011)Universal Domains and the Amalgamation Property., and . Math. Struct. Comput. Sci., 3 (2): 137-159 (1993)Weighted automata and multi-valued logics over arbitrary bounded lattices., and . Theor. Comput. Sci., (2012)A Nivat Theorem for Quantitative Automata on Unranked Trees., and . Models, Algorithms, Logics and Tools, volume 10460 of Lecture Notes in Computer Science, page 22-35. Springer, (2017)A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic., and . LATA, volume 8977 of Lecture Notes in Computer Science, page 703-715. Springer, (2015)Weighted Automata and Weighted Logics on Infinite Words., and . Developments in Language Theory, volume 4036 of Lecture Notes in Computer Science, page 49-58. Springer, (2006)Effectively Given Information Systems and Domains., and . CSL, volume 440 of Lecture Notes in Computer Science, page 116-142. Springer, (1989)From Domains to Automata with Concurrency., and . ICALP, volume 700 of Lecture Notes in Computer Science, page 669-681. Springer, (1993)