Travelled to:1 × Czech Republic
1 × Denmark
1 × France
1 × Hungary
1 × Japan
1 × New Zealand
1 × Portugal
1 × Switzerland
1 × The Netherlands
2 × Austria
2 × Germany
2 × Spain
3 × USA
3 × United Kingdom
Collaborated with:M.Lohrey ∅ J.Liu I.Meinecke M.Droste B.Bollig B.Genest A.Muscholl P.Habermehl P.Weigel A.Moskvina R.Mennicke L.Heimberg N.Schweikardt B.Borchert F.Stephan F.A.Zaid P.Lindner R.Corran M.Hoffmann R.M.Thomas D.Peled
Talks about:automat (8) structur (5) automata (5) theori (4) isomorph (3) languag (3) infinit (3) system (3) order (3) monad (3)
Person: Dietrich Kuske
DBLP: Kuske:Dietrich
Contributed to:
2015
2015
20132012
2011201020102009
2008
2008200720062006
20052004
2003
2003200220012000199819952018Wrote 25 papers:
- CSL-2015-KuskeLM #decidability #infinity #monad #word
- Infinite and Bi-infinite Words with Decidable Monadic Theories (DK, JL, AM), pp. 472–486.
- FoSSaCS-2015-HabermehlK #on the #quantifier
- On Presburger Arithmetic Extended with Modulo Counting Quantifiers (PH, DK), pp. 375–389.
- LICS-2013-BolligKM #complexity #model checking #multi
- The Complexity of Model Checking Multi-stack Systems (BB, DK, RM), pp. 163–172.
- LICS-2013-HeimbergKS #bound #normalisation
- An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree (LH, DK, NS), pp. 63–72.
- CSL-2012-Kuske #automation #linear #morphism #order
- Isomorphisms of scattered automatic linear orders (DK), pp. 455–469.
- LATA-2011-CorranHKT #automation #finite #monad
- Singular Artin Monoids of Finite Coxeter Type Are Automatic (RC, MH, DK, RMT), pp. 250–261.
- CSL-2010-KuskeLL #morphism #problem
- The Isomorphism Problem for ω-Automatic Trees (DK, JL, ML), pp. 396–410.
- LICS-2010-KuskeLL #automation #morphism #problem
- The Isomorphism Problem on Classes of Automatic Structures (DK, JL, ML), pp. 160–169.
- CSL-2009-KuskeL #automation #bound #revisited
- Automatic Structures of Bounded Degree Revisited (DK, ML), pp. 364–378.
- AFL-2008-KuskeL #automation #graph #recursion
- Euler paths and ends in automatic and recursive graphs (DK, ML), pp. 245–256.
- DLT-2008-KuskeM #automaton #regular expression
- Construction of Tree Automata from Regular Expressions (DK, IM), pp. 491–503.
- LATA-2007-BolligK #automaton #logic #message passing
- Muller Message-Passing Automata and Logics (BB, DK), pp. 163–174.
- FoSSaCS-2006-KuskeL #first-order
- First-Order and Counting Theories of ω-Automatic Structures (DK, ML), pp. 322–336.
- LICS-2006-KuskeL #automaton #logic #monad
- Monadic Chain Logic Over Iterations and Applications to Pushdown Systems (DK, ML), pp. 91–100.
- TACAS-2005-GenestKMP #verification
- Snapshot Verification (BG, DK, AM, DP), pp. 510–525.
- DLT-2004-GenestMK #algorithm #automaton #communication #effectiveness #theorem
- A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms (BG, AM, DK), pp. 30–48.
- DLT-2004-KuskeW #automaton
- The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems (DK, PW), pp. 272–283.
- CIAA-2003-KuskeM #automaton #branch #parallel
- Branching Automata with Costs — A Way of Reflecting Parallelism in Costs (DK, IM), pp. 150–162.
- ICALP-2003-DrosteK
- Skew and Infinitary Formal Power Series (MD, DK), pp. 426–438.
- ICALP-2002-KuskeL #formal method #monad #on the
- On the Theory of One-Step Rewriting in Trace Monoids (DK, ML), pp. 752–763.
- DLT-2001-Kuske #axiom #set
- Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable (DK), pp. 206–216.
- ICALP-2000-Kuske #infinity #logic
- Infinite Series-Parallel Posets: Logic and Languages (DK), pp. 648–662.
- ICALP-1998-BorchertKS #first-order #on the
- On Existentially First-Order Definable Languages and Their Relation to NP (BB, DK, FS), pp. 17–28.
- DLT-1995-DrosteK #composition #quantifier
- Trace Languages Definable with Modular Quantifiers (MD, DK), pp. 386–395.
- CSL-2018-ZaidKL #automation #complexity
- Climbing up the Elementary Complexity Classes with Theories of Automatic Structures (FAZ, DK, PL), p. 16.