Travelled to:1 × Czech Republic
1 × Denmark
1 × Greece
1 × Hungary
1 × Israel
1 × Spain
1 × Sweden
1 × The Netherlands
2 × Canada
2 × France
2 × Germany
2 × Italy
2 × Portugal
2 × USA
Collaborated with:H.Vogler I.Meinecke G.Rahonis P.Gastin D.Kuske ∅ R.Göbel P.Babari V.Perevoshchikov S.Dück B.Pibaljommee K.Quaas G.Zhang F.Bracho Z.Ésik W.Kuich B.Seselja A.Tepavcevic
Talks about:weight (17) automata (13) logic (8) theorem (7) languag (5) domain (4) schützenberg (3) concurr (3) formal (3) power (3)
Person: Manfred Droste
DBLP: Droste:Manfred
Contributed to:
2015
20142014
20132014
20122011201020112010
20082007200620052003200119971995199419931990
1990
1989
2017Wrote 24 papers:
- LATA-2015-BabariD #automaton #logic #theorem
- A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic (PB, MD), pp. 703–715.
- ICALP-v2-2014-DrosteP #automaton #distance #logic #theorem
- A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic (MD, VP), pp. 171–182.
- LATA-2014-DrosteD #automaton #infinity #logic #word
- Weighted Automata and Logics for Infinite Nested Words (MD, SD), pp. 323–334.
- DLT-2013-DrosteV #context-free grammar #theorem
- The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages (MD, HV), pp. 203–214.
- DLT-J-2013-DrosteV14 #context-free grammar #theorem
- The Chomsky-SCHüTzenberger Theorem for Quantitative Context-Free Languages (MD, HV), pp. 955–970.
- CIAA-2012-DrosteP #automaton #logic #word
- Weighted Nested Word Automata and Logics over Strong Bimonoids (MD, BP), pp. 138–148.
- DLT-2011-DrosteMST #composition #finite
- A Cascade Decomposition of Weighted Finite Transition Systems (MD, IM, BS, AT), pp. 472–473.
- CIAA-2010-DrosteM #regular expression
- Regular Expressions on Average and in the Long Run (MD, IM), pp. 211–221.
- CIAA-J-2010-DrosteM11 #automaton #monad #regular expression
- Weighted Automata and Regular Expressions over Valuation Monoids (MD, IM), pp. 1829–1844.
- DLT-2010-DrosteV #automaton #bound #logic #multi #theorem
- Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices (MD, HV), pp. 160–172.
- FoSSaCS-2008-DrosteQ #automaton #theorem
- A Kleene-Schützenberger Theorem for Weighted Timed Automata (MD, KQ), pp. 142–156.
- CIAA-2007-DrosteR #automaton #logic
- Weighted Automata and Weighted Logics with Discounting (MD, GR), pp. 73–84.
- DLT-2006-DrosteR #automaton #infinity #logic #word
- Weighted Automata and Weighted Logics on Infinite Words (MD, GR), pp. 49–58.
- ICALP-2005-DrosteG #automaton #logic
- Weighted Automata and Weighted Logics (MD, PG), pp. 513–525.
- ICALP-2003-DrosteK
- Skew and Infinitary Formal Power Series (MD, DK), pp. 426–438.
- ICALP-2001-DrosteZ
- Rational Transformations of Formal Power Series (MD, GQZ), pp. 555–566.
- ICALP-1997-DrosteG #on the
- On Recognizable and Rational Formal Power Series in Partially Commuting Variables (MD, PG), pp. 682–692.
- DLT-1995-DrosteK #composition #quantifier
- Trace Languages Definable with Modular Quantifiers (MD, DK), pp. 386–395.
- ICALP-1994-Droste #concurrent #monad #theorem
- A KLeene Theorem for Recognizable Languages over Concurrency Monoids (MD), pp. 388–399.
- ICALP-1993-BrachoD #automaton #concurrent
- From Domains to Automata with Concurrency (FB, MD), pp. 669–681.
- ICALP-1990-Droste #automaton #concurrent
- Concurrency, Automata and Domains (MD), pp. 195–208.
- LICS-1990-DrosteG #formal method #programming language #semantics
- Universal Domains in the Theory of Denotational Semantics of Programming Languages (MD, RG), pp. 19–34.
- CSL-1989-DrosteG #effectiveness #information management
- Effectively Given Information Systems and Domains (MD, RG), pp. 116–142.
- AFL-2017-DrosteEK #automaton
- The Triple-Pair Construction for Weighted ω-Pushdown Automata (MD, ZÉ, WK), pp. 101–113.