Dietrich Kuske

138 papers A* 11A 9B 24C 11Misc 2Journal 62Unranked 14
YearRankTypeTitle / Venue / Authors
2025 J jnl
Backwards-reachability for cooperating multi-pushdown systems.
J. Comput. Syst. Sci.
Chris Köcher, Dietrich Kuske
2025 J jnl
Boolean basis, formula size, and number of modal operators.
Log. Methods Comput. Sci.
Christoph Berkholz, Dietrich Kuske, Christian Schwarz
2025 B conf
Disjointness, Inclusion, and Regularity of ømega-Rational Trace Languages - Extended Abstract -.
FCT
Dietrich Kuske
2025 J jnl
Reachability in Trace-Pushdown Systems.
CoRR
Chris Köcher, Dietrich Kuske
2025 C conf
The Theory of Reachability of Trace-Pushdown Systems.
CiE
Dietrich Kuske
2025 J jnl
The theory of reachability in trace-pushdown systems.
CoRR
Dietrich Kuske
2024 J jnl
Boolean basis, formula size, and number of modal operators.
CoRR
Christoph Berkholz, Dietrich Kuske, Christian Schwarz
2024 A conf
Modal Logic Is More Succinct Iff Bi-Implication Is Available in Some Form.
STACS
Christoph Berkholz, Dietrich Kuske, Christian Schwarz
2023 — conf
A Class of Rational Trace Relations Closed Under Composition.
FSTTCS
Dietrich Kuske
2023 J jnl
Alternating complexity of counting first-order logic for the subword order.
Acta Informatica
Dietrich Kuske, Christian Schwarz
2023 B conf
Forwards- and Backwards-Reachability for Cooperating Multi-pushdown Systems.
FCT
Chris Köcher, Dietrich Kuske
2023 J jnl
On Presburger arithmetic extended with non-unary counting quantifiers.
Log. Methods Comput. Sci.
Peter Habermehl, Dietrich Kuske
2022 J jnl
On Presburger arithmetic extended with non-unary counting quantifiers.
CoRR
Peter Habermehl, Dietrich Kuske
2021 — ch.
Communicating automata.
Handbook of Automata Theory (II.)
Dietrich Kuske, Anca Muscholl
2021 C conf
Second-Order Finite Automata: Expressive Power and Simple Proofs Using Automatic Structures.
DLT
Dietrich Kuske
2021 — ch.
Weighted automata.
Handbook of Automata Theory (I.)
Manfred Droste, Dietrich Kuske
2020 B conf
Complexity of Counting First-Order Logic for the Subword Order.
MFCS
Dietrich Kuske, Christian Schwarz
2020 Misc conf
The Subtrace Order and Counting First-Order Logic.
CSR
Dietrich Kuske
2019 B conf
Languages Ordered by the Subword Order.
FoSSaCS
Dietrich Kuske, Georg Zetzsche
2019 J jnl
Languages ordered by the subword order.
CoRR
Dietrich Kuske, Georg Zetzsche
2018 B conf
Climbing up the Elementary Complexity Classes with Theories of Automatic Structures.
CSL
Faried Abu Zaid, Dietrich Kuske, Peter Lindner
2018 A* conf
Gaifman Normal Forms for Counting Extensions of First-Order Logic.
ICALP
Dietrich Kuske, Nicole Schweikardt
2018 J jnl
Infinite and Bi-infinite Words with Decidable Monadic Theories.
Log. Methods Comput. Sci.
Dietrich Kuske, Jiamou Liu, Anastasia Moskvina
2018 J jnl
Multi-buffer simulations: Decidability and complexity.
Inf. Comput.
Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes
2018 J jnl
The inclusion structure of partially lossy queue monoids and their trace submonoids.
RAIRO Theor. Informatics Appl.
Chris Köcher, Dietrich Kuske, Olena Prianychnykova
2017 J jnl
First-Order Logic with Counting: At Least, Weak Hanf Normal Forms Always Exist and Can Be Computed!
CoRR
Dietrich Kuske, Nicole Schweikardt
2017 A* conf
First-order logic with counting.
LICS
Dietrich Kuske, Nicole Schweikardt
2017 J jnl
Infinite and Bi-infinite Words with Decidable Monadic Theories.
CoRR
Dietrich Kuske, Jiamou Liu, Anastasia Moskvina
2017 J jnl
On Boolean Closed Full Trios and Rational Kripke Frames.
Theory Comput. Syst.
Georg Zetzsche, Dietrich Kuske, Markus Lohrey
2017 J jnl
The Complexity of Model Checking Multi-Stack Systems.
Theory Comput. Syst.
Benedikt Bollig, Dietrich Kuske, Roy Mennicke
2017 Misc conf
The Transformation Monoid of a Partially Lossy Queue.
CSR
Chris Köcher, Dietrich Kuske
2016 A* conf
Hanf normal form for first-order logic with unary counting quantifiers.
LICS
Lucas Heimberg, Dietrich Kuske, Nicole Schweikardt
2016 — conf
Multi-Buffer Simulations for Trace Language Inclusion.
GandALF
Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes
2016 C conf
The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids.
DLT
Dietrich Kuske, Olena Prianychnykova
2016 J jnl
The trace monoids in the queue monoid and in the direct product of two free monoids.
CoRR
Dietrich Kuske, Olena Prianychnykova
2016 — conf
Two-Buffer Simulation Games.
Cassting/SynCoP
Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes
2015 B conf
Infinite and Bi-infinite Words with Decidable Monadic Theories.
CSL
Dietrich Kuske, Jiamou Liu, Anastasia Moskvina
2015 B conf
On Presburger Arithmetic Extended with Modulo Counting Quantifiers.
FoSSaCS
Peter Habermehl, Dietrich Kuske
2014 J jnl
Isomorphisms of scattered automatic linear orders.
Theor. Comput. Sci.
Dietrich Kuske
2014 — conf
The Monoid of Queue Actions.
MFCS (1)
Martin Huschenbett, Dietrich Kuske, Georg Zetzsche
2014 J jnl
The monoid of queue actions.
CoRR
Martin Huschenbett, Dietrich Kuske, Georg Zetzsche
2013 A* conf
An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree.
LICS
Lucas Heimberg, Dietrich Kuske, Nicole Schweikardt
2013 B conf
Logical Aspects of the Lexicographic Order on 1-Counter Languages.
MFCS
Dietrich Kuske
2013 J jnl
On the automaticity of singular Artin monoids of finite type.
Int. J. Comput. Math.
Ruth Corran, Michael Hoffmann, Dietrich Kuske, Richard M. Thomas
2013 A* conf
The Complexity of Model Checking Multi-stack Systems.
LICS
Benedikt Bollig, Dietrich Kuske, Roy Mennicke
2013 J jnl
The isomorphism problem for ω-automatic trees.
Ann. Pure Appl. Log.
Dietrich Kuske, Jiamou Liu, Markus Lohrey
2012 J jnl
An optimal construction of Hanf sentences.
J. Appl. Log.
Benedikt Bollig, Dietrich Kuske
2012 J jnl
Isomorphisms of scattered automatic linear orders
CoRR
Dietrich Kuske
2012 B conf
Isomorphisms of scattered automatic linear orders.
CSL
Dietrich Kuske
2011 J jnl
An optimal construction of Hanf sentences
CoRR
Benedikt Bollig, Dietrich Kuske
2011 J jnl
Automatic structures of bounded degree revisited.
J. Symb. Log.
Dietrich Kuske, Markus Lohrey
2011 J jnl
Construction of tree automata from regular expressions.
RAIRO Theor. Informatics Appl.
Dietrich Kuske, Ingmar Meinecke
2011 C conf
Singular Artin Monoids of Finite Coxeter Type Are Automatic.
LATA
Ruth Corran, Michael Hoffmann, Dietrich Kuske, Richard M. Thomas
2011 B conf
Size and Computation of Injective Tree Automatic Presentations.
MFCS
Dietrich Kuske, Thomas Weidner
2011 — conf
Where Automatic Structures Benefit from Weighted Automata.
Algebraic Foundations in Computer Science
Dietrich Kuske
2010 A conf
Is Ramsey's Theorem omega-automatic?.
STACS
Dietrich Kuske
2010 J jnl
Propositional Dynamic Logic for Message-Passing Systems
Log. Methods Comput. Sci.
Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke
2010 J jnl
Some natural decision problems in automatic graphs.
J. Symb. Log.
Dietrich Kuske, Markus Lohrey
2010 J jnl
The Isomorphism Problem On Classes of Automatic Structures
CoRR
Dietrich Kuske, Jiamou Liu, Markus Lohrey
2010 B conf
The Isomorphism Problem for
CSL
Dietrich Kuske, Jiamou Liu, Markus Lohrey
2010 J jnl
The Isomorphism Problem for omega-Automatic Trees
CoRR
Dietrich Kuske, Jiamou Liu, Markus Lohrey
2010 A* conf
The Isomorphism Problem on Classes of Automatic Structures.
LICS
Dietrich Kuske, Jiamou Liu, Markus Lohrey
2010 J jnl
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces.
Inf. Comput.
Paul Gastin, Dietrich Kuske
2009 — conf
(Un)countable and (Non)effective Versions of Ramsey's Theorem.
AMS-ASL Joint Special Session
Dietrich Kuske
2009 B conf
Automatic Structures of Bounded Degree Revisited.
CSL
Dietrich Kuske, Markus Lohrey
2009 J jnl
Is Ramsey's theorem omega-automatic?
CoRR
Dietrich Kuske
2009 — conf
Theories of Automatic Structures and Their Complexity.
CAI
Dietrich Kuske
2009 J jnl
Weighted and Unweighted Trace Automata.
Acta Cybern.
Dietrich Kuske
2008 — ed.
Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007
Algorithmic-Logical Theory of Infinite Structures
Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi
2008 J jnl
Automatic structures of bounded degree revisited
CoRR
Dietrich Kuske, Markus Lohrey
2008 J jnl
Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic
CoRR
Dietrich Kuske
2008 A conf
Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic.
STACS
Dietrich Kuske
2008 C conf
Construction of Tree Automata from Regular Expressions.
Developments in Language Theory
Dietrich Kuske, Ingmar Meinecke
2008 — conf
Euler paths and ends in automatic and recursive graphs.
AFL
Dietrich Kuske, Markus Lohrey
2008 J jnl
First-order and counting theories of omega-automatic structures.
J. Symb. Log.
Dietrich Kuske, Markus Lohrey
2008 — conf
Hamiltonicity of automatic graphs.
IFIP TCS
Dietrich Kuske, Markus Lohrey
2008 J jnl
Muller message-passing automata and logics.
Inf. Comput.
Benedikt Bollig, Dietrich Kuske
2008 J jnl
Schützenberger's theorem on formal power series follows from Kleene's theorem.
Theor. Comput. Sci.
Dietrich Kuske
2007 — conf
07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures.
Algorithmic-Logical Theory of Infinite Structures
Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi
2007 — conf
07441 Summary -- Algorithmic-Logical Theory of Infinite Structures.
Algorithmic-Logical Theory of Infinite Structures
Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi
2007 B conf
Almost Every Domain is Universal.
MFPS
Manfred Droste, Dietrich Kuske
2007 — conf
Compatibility of Shelah and Stupp's and of Muchnik's iteration with fragments of monadic second order logic.
Algorithmic-Logical Theory of Infinite Structures
Dietrich Kuske
2007 C conf
Muller Message-Passing Automata and Logics.
LATA
Benedikt Bollig, Dietrich Kuske
2007 J jnl
On Communicating Automata with Bounded Channels.
Fundam. Informaticae
Blaise Genest, Dietrich Kuske, Anca Muscholl
2007 — conf
Propositional Dynamic Logic for Message-Passing Systems.
FSTTCS
Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke
2007 J jnl
Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces.
Fundam. Informaticae
Paul Gastin, Dietrich Kuske
2007 J jnl
Weighted asynchronous cellular automata.
Theor. Comput. Sci.
Dietrich Kuske
2006 J jnl
A Kleene theorem and model checking algorithms for existentially bounded communicating automata.
Inf. Comput.
Blaise Genest, Dietrich Kuske, Anca Muscholl
2006 B conf
First-Order and Counting Theories of
FoSSaCS
Dietrich Kuske, Markus Lohrey
2006 J jnl
Logical Aspects of Cayley-graphs: the Monoid Case.
Int. J. Algebra Comput.
Dietrich Kuske, Markus Lohrey
2006 A* conf
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems.
LICS
Dietrich Kuske, Markus Lohrey
2006 J jnl
Skew and infinitary formal power series.
Theor. Comput. Sci.
Manfred Droste, Dietrich Kuske
2006 J jnl
Theories of orders on the set of words.
RAIRO Theor. Informatics Appl.
Dietrich Kuske
2006 A conf
Weighted Asynchronous Cellular Automata.
STACS
Dietrich Kuske
2005 J jnl
Decidable First-Order Theories of One-Step Rewriting in Trace Monoids.
Theory Comput. Syst.
Dietrich Kuske, Markus Lohrey
2005 J jnl
Logical aspects of Cayley-graphs: the group case.
Ann. Pure Appl. Log.
Dietrich Kuske, Markus Lohrey
2005 A conf
Snapshot Verification.
TACAS
Blaise Genest, Dietrich Kuske, Anca Muscholl, Doron A. Peled
2005 B conf
Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces.
CONCUR
Paul Gastin, Dietrich Kuske
2004 C conf
A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms.
Developments in Language Theory
Blaise Genest, Anca Muscholl, Dietrich Kuske
2004 J jnl
Branching automata with costs - a way of reflecting parallelism in costs star.
Theor. Comput. Sci.
Dietrich Kuske, Ingmar Meinecke
2004 C conf
The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems.
Developments in Language Theory
Dietrich Kuske, Peter Weigel
2003 C conf
Branching Automata with Costs - A Way of Reflecting Parallelism in Costs.
CIAA
Dietrich Kuske, Ingmar Meinecke
2003 A conf
Decidable Theories of Cayley-Graphs.
STACS
Dietrich Kuske, Markus Lohrey
2003 B conf
Is Cantor's Theorem Automatic?
LPAR
Dietrich Kuske
2003 J jnl
On random relational structures.
J. Comb. Theory A
Manfred Droste, Dietrich Kuske
2003 J jnl
Regular sets of infinite message sequence charts.
Inf. Comput.
Dietrich Kuske
2003 B conf
Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE.
CONCUR
Paul Gastin, Dietrich Kuske
2003 A* conf
Skew and Infinitary Formal Power Series.
ICALP
Manfred Droste, Dietrich Kuske
2003 J jnl
The topology of Mazurkiewicz traces.
Theor. Comput. Sci.
Ralph Kummetz, Dietrich Kuske
2003 J jnl
Towards a language theory for infinite N-free pomsets.
Theor. Comput. Sci.
Dietrich Kuske
2002 A conf
A Further Step towards a Theory of Regular MSC Languages.
STACS
Dietrich Kuske
2002 A* conf
On the Theory of One-Step Rewriting in Trace Monoids.
ICALP
Dietrich Kuske, Markus Lohrey
2002 J jnl
Pomsets for Local Trace Languages.
J. Autom. Lang. Comb.
Dietrich Kuske, Rémi Morin
2001 A conf
A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets.
STACS
Dietrich Kuske
2001 B conf
Divisibility Monoids: Presentation, Word Problem, and Rational Languages.
FCT
Dietrich Kuske
2001 C conf
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable.
Developments in Language Theory
Dietrich Kuske
2001 J jnl
Recognizable languages in divisibility monoids.
Math. Struct. Comput. Sci.
Manfred Droste, Dietrich Kuske
2000 J jnl
Asynchronous cellular automata for pomsets.
Theor. Comput. Sci.
Manfred Droste, Paul Gastin, Dietrich Kuske
2000 — book
Contributions to a trace theory beyond Mazurkiewicz traces.
Dietrich Kuske
2000 B conf
Emptiness Is Decidable for Asynchronous Cellular Machines.
CONCUR
Dietrich Kuske
2000 A* conf
Infinite Series-Parallel Posets: Logic and Languages.
ICALP
Dietrich Kuske
2000 B conf
Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets.
CONCUR
Dietrich Kuske, Rémi Morin
2000 B conf
The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus.
LPAR
Steffen Hölldobler, Dietrich Kuske
1999 J jnl
On Homogeneous Semilattices and Their Automorphism Groups.
Order
Manfred Droste, Dietrich Kuske, John Kenneth Truss
1999 B conf
On Recognizable Languages in Divisibility Monoids.
FCT
Manfred Droste, Dietrich Kuske
1999 J jnl
On existentially first-order definable languages and their relation to NP.
RAIRO Theor. Informatics Appl.
Bernd Borchert, Dietrich Kuske, Frank Stephan
1999 J jnl
Symmetries of the Partial Order of Traces.
Order
Dietrich Kuske
1998 B conf
Asynchronous Cellular Automata and Asynchronous Automata for Pomsets.
CONCUR
Dietrich Kuske
1998 A* conf
On Existentially First-Order Definable Languages and Their Relation to NP.
ICALP
Bernd Borchert, Dietrich Kuske, Frank Stephan
1998 J jnl
Recognizable and Logically Definable Languages of Infinite Computations in Concurrent Automata.
Int. J. Found. Comput. Sci.
Manfred Droste, Dietrich Kuske
1998 J jnl
Topology for Computations of Concurrent Automata.
Int. J. Algebra Comput.
Dietrich Kuske, R. M. Shortt
1997 J jnl
On Existentially First-Order Definable Languages and their Relation to NP
Electron. Colloquium Comput. Complex.
Bernd Borchert, Dietrich Kuske, Frank Stephan
1997 J jnl
Representation of Computations in Concurrent Automata by Dependence Orders.
Theor. Comput. Sci.
Felipe Bracho, Manfred Droste, Dietrich Kuske
1995 A conf
Dependence Orders for Computations of Concurrent Automata.
STACS
Felipe Bracho, Manfred Droste, Dietrich Kuske
1995 B conf
Languages and Logical Definability in Concurrency Monoids.
CSL
Manfred Droste, Dietrich Kuske
1995 C conf
Trace Languages Definable with Modular Quantifiers.
Developments in Language Theory
Manfred Droste, Dietrich Kuske
1994 — conf
Nondeterministic Automata with Concurrency Relations and Domains.
CAAP
Dietrich Kuske
1993 — —
Modelle nebenläufiger Prozesse - Monoide, Residuensysteme und Automaten.
Dietrich Kuske