Dietrich Kuske

发表

Topology for Computations of Concurrent Automata

Dietrich Kuske, R. M. Shortt, R. Shortt, 1998, Int. J. Algebra Comput..

Is Cantor's Theorem Automatic?

Dietrich Kuske, D. Kuske, 2003, LPAR.

On the Theory of One-Step Rewriting in Trace Monoids

Markus Lohrey, Dietrich Kuske, D. Kuske, 2002, ICALP.

The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus

Steffen Hölldobler, Dietrich Kuske, 2000, LPAR.

(Un)countable and (Non)effective Versions of Ramsey's Theorem

Dietrich Kuske, 2009, AMS-ASL Joint Special Session.

Emptiness Is Decidable for Asynchronous Cellular Machines

Dietrich Kuske, 2000, CONCUR.

On the automaticity of singular Artin monoids of finite type

Richard M. Thomas, Dietrich Kuske, Michael Hoffmann, 2013, Int. J. Comput. Math..

Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces

Paul Gastin, Dietrich Kuske, 2007, Fundam. Informaticae.

The inclusion structure of partially lossy queue monoids and their trace submonoids

Dietrich Kuske, Chris Köcher, Olena Prianychnykova, 2018, RAIRO Theor. Informatics Appl..

Skew and infinitary formal power series

Manfred Droste, Dietrich Kuske, M. Droste, 2003, Theor. Comput. Sci..

Alternating complexity of counting first-order logic for the subword order

Dietrich Kuske, Christian Schwarz, Christian Schwarz, 2022, Acta Informatica.

Branching Automata with Costs - A Way of Reflecting Parallelism in Costs

Dietrich Kuske, Ingmar Meinecke, 2003, CIAA.

Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces

Paul Gastin, Dietrich Kuske, 2010, Inf. Comput..

The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems

Dietrich Kuske, Peter Weigel, 2004, Developments in Language Theory.

First-order logic with counting

Nicole Schweikardt, Dietrich Kuske, Nicole Schweikardt, 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

The Complexity of Model Checking Multi-Stack Systems

Benedikt Bollig, Dietrich Kuske, Roy Mennicke, 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

Skew and Infinitary Formal Power Series

Manfred Droste, Dietrich Kuske, 2003, ICALP.

On existentially first-order definable languages and their relation to NP

Frank Stephan, Dietrich Kuske, Bernd Borchert, 1999, RAIRO Theor. Informatics Appl..

Asynchronous cellular automata for pomsets

Paul Gastin, Manfred Droste, Dietrich Kuske, 2000, Theor. Comput. Sci..

Automatic structures of bounded degree revisited

Markus Lohrey, Dietrich Kuske, 2011, J. Symb. Log..

Propositional Dynamic Logic for Message-Passing Systems

Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke, 2010, Log. Methods Comput. Sci..

07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures

Rodney G. Downey, Markus Lohrey, Moshe Y. Vardi, 2007, Algorithmic-Logical Theory of Infinite Structures.

Regular sets of infinite message sequence charts

Dietrich Kuske, D. Kuske, 2003, Inf. Comput..

Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable

Dietrich Kuske, D. Kuske, 2001, Developments in Language Theory.

Towards a language theory for infinite N-free pomsets

Dietrich Kuske, D. Kuske, 2003, Theor. Comput. Sci..

Nondeterministic Automata with Concurrency Relations and Domains

Dietrich Kuske, 1994, CAAP.

On Boolean Closed Full Trios and Rational Kripke Frames

Markus Lohrey, Georg Zetzsche, Dietrich Kuske, 2017, Theory of Computing Systems.

An optimal construction of Hanf sentences pdf

Benedikt Bollig, Dietrich Kuske, D. Kuske, 2011, J. Appl. Log..

A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets

Dietrich Kuske, D. Kuske, 2001, STACS.

Languages ordered by the subword order pdf

Georg Zetzsche, Dietrich Kuske, 2019, FoSSaCS.

Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets

Dietrich Kuske, Rémi Morin, D. Kuske, 2000, CONCUR.

Hamiltonicity of automatic graphs

Markus Lohrey, Dietrich Kuske, 2008, IFIP TCS.

Gaifman Normal Forms for Counting Extensions of First-Order Logic

Nicole Schweikardt, Dietrich Kuske, Nicole Schweikardt, 2018, ICALP.

Recognizable languages in divisibility monoids

Manfred Droste, Dietrich Kuske, 2001, Math. Struct. Comput. Sci..

On Homogeneous Semilattices and Their Automorphism Groups

Manfred Droste, John K. Truss, Dietrich Kuske, 1999, Order.

Climbing up the Elementary Complexity Classes with Theories of Automatic Structures

Dietrich Kuske, Faried Abu Zaid, Peter Lindner, 2018, CSL.

Size and Computation of Injective Tree Automatic Presentations

Dietrich Kuske, Thomas Weidner, D. Kuske, 2011, MFCS.

Pomsets for Local Trace Languages

Dietrich Kuske, Rémi Morin, 2002, J. Autom. Lang. Comb..

First-Order Logic with Counting: At Least, Weak Hanf Normal Forms Always Exist and Can Be Computed! pdf

Nicole Schweikardt, Dietrich Kuske, 2017, LICS 2017.

The Transformation Monoid of a Partially Lossy Queue

Dietrich Kuske, Chris Köcher, 2017, CSR.

The Isomorphism Problem for omega-Automatic Trees pdf

Markus Lohrey, Dietrich Kuske, Jiamou Liu, 2010, CSL.

Schützenberger's theorem on formal power series follows from Kleene's theorem

Dietrich Kuske, 2008, Theor. Comput. Sci..

Asynchronous Cellular Automata and Asynchronous Automata for Pomsets

Dietrich Kuske, D. Kuske, 1998, CONCUR.

Is Ramsey's theorem omega-automatic? pdf

Dietrich Kuske, 2010, STACS.

Snapshot Verification

Anca Muscholl, Doron A. Peled, Dietrich Kuske, 2005, TACAS.

Infinite and Bi-infinite Words with Decidable Monadic Theories

Dietrich Kuske, Jiamou Liu, Anastasia Moskvina, 2015, CSL.

Theories of orders on the set of words

Dietrich Kuske, D. Kuske, 2006, RAIRO Theor. Informatics Appl..

Multi-buffer simulations: Decidability and complexity

Norbert Hundeshagen, Martin Lange, Dietrich Kuske, 2018, Inf. Comput..

Monadic Chain Logic Over Iterations and Applications to Pushdown Systems

Markus Lohrey, Dietrich Kuske, D. Kuske, 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

Logical Aspects of Cayley-graphs: the Monoid Case

Markus Lohrey, Dietrich Kuske, 2006, Int. J. Algebra Comput..

Multi-Buffer Simulations for Trace Language Inclusion

Norbert Hundeshagen, Martin Lange, Dietrich Kuske, 2016, GandALF.

Weighted and Unweighted Trace Automata

Dietrich Kuske, 2009, Acta Cybern..

Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces

Paul Gastin, Dietrich Kuske, D. Kuske, 2005, Inf. Comput..

Isomorphisms of scattered automatic linear orders

Dietrich Kuske, 2012, CSL.

07441 Summary -- Algorithmic-Logical Theory of Infinite Structures

Rodney G. Downey, Markus Lohrey, Moshe Y. Vardi, 2007, Algorithmic-Logical Theory of Infinite Structures.

Some natural decision problems in automatic graphs

Markus Lohrey, Dietrich Kuske, 2010, J. Symb. Log..

Construction of tree automata from regular expressions

Dietrich Kuske, Ingmar Meinecke, 2011, RAIRO Theor. Informatics Appl..

A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms

Anca Muscholl, Dietrich Kuske, Blaise Genest, 2004, Developments in Language Theory.

Recognizable and Logically Definable Languages of Infinite Computations in Concurrent Automata

Manfred Droste, Dietrich Kuske, 1998, Int. J. Found. Comput. Sci..

A Kleene theorem and model checking algorithms for existentially bounded communicating automata

Anca Muscholl, Dietrich Kuske, Blaise Genest, 2006, Inf. Comput..

Two-Buffer Simulation Games

Norbert Hundeshagen, Martin Lange, Dietrich Kuske, 2016, Cassting/SynCoP.

Almost Every Domain is Universal

Manfred Droste, Dietrich Kuske, M. Droste, 2007, MFPS.

A Further Step towards a Theory of Regular MSC Languages

Dietrich Kuske, D. Kuske, 2002, STACS.

Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE

Paul Gastin, Dietrich Kuske, 2003, CONCUR.

Infinite and Bi-infinite Words with Decidable Monadic Theories

Dietrich Kuske, Jiamou Liu, Anastasia Moskvina, 2018, Log. Methods Comput. Sci..

On Existentially First-Order Definable Languages and Their Relation to NP

Frank Stephan, Dietrich Kuske, Bernd Borchert, 1998, ICALP.

Contributions to a trace theory beyond Mazurkiewicz traces

Dietrich Kuske, D. Kuske, 2011 .

Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic pdf

Dietrich Kuske, 2008, STACS.

Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007

Markus Lohrey, Moshe Y. Vardi, Dietrich Kuske, 2008, Algorithmic-Logical Theory of Infinite Structures.

The topology of Mazurkiewicz traces

Dietrich Kuske, Ralph Kummetz, 2003, Theor. Comput. Sci..

Construction of Tree Automata from Regular Expressions

Dietrich Kuske, Ingmar Meinecke, 2008, Developments in Language Theory.

Logical aspects of Cayley-graphs: the group case

Markus Lohrey, Dietrich Kuske, D. Kuske, 2005, Ann. Pure Appl. Log..

Weighted Asynchronous Cellular Automata

Dietrich Kuske, 2006, STACS.

Decidable Theories of Cayley-Graphs

Markus Lohrey, Dietrich Kuske, 2003, STACS.

Modelle nebenläufiger Prozesse - Monoide, Residuensysteme und Automaten

Dietrich Kuske, 1993 .

Weighted asynchronous cellular automata

Dietrich Kuske, D. Kuske, 2006, Theor. Comput. Sci..

Trace Languages Definable with Modular Quantifiers

Manfred Droste, Dietrich Kuske, M. Droste, 1995, Developments in Language Theory.

The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids pdf

Dietrich Kuske, Olena Prianychnykova, 2016, DLT.

The Subtrace Order and Counting First-Order Logic

Dietrich Kuske, D. Kuske, 2020, CSR.

Languages and Logical Definability in Concurrency Monoids

Manfred Droste, Dietrich Kuske, 1995, CSL.

Branching automata with costs - a way of reflecting parallelism in costs star

Dietrich Kuske, Ingmar Meinecke, 2004, Theor. Comput. Sci..

Logical Aspects of the Lexicographic Order on 1-Counter Languages

Dietrich Kuske, 2013, MFCS.

Where Automatic Structures Benefit from Weighted Automata

Dietrich Kuske, 2011, Algebraic Foundations in Computer Science.

Singular Artin Monoids of Finite Coxeter Type Are Automatic

Richard M. Thomas, Dietrich Kuske, Michael Hoffmann, 2011, LATA.

Infinite Series-Parallel Posets: Logic and Languages

Dietrich Kuske, D. Kuske, 2000, ICALP.

First-order and counting theories of omega-automatic structures

Markus Lohrey, Dietrich Kuske, D. Kuske, 2006, J. Symb. Log..

The monoid of queue actions

Georg Zetzsche, Dietrich Kuske, Martin Huschenbett, 2014, MFCS.

An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree

Nicole Schweikardt, Dietrich Kuske, Lucas Heimberg, 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

The isomorphism problem for ω-automatic trees

Markus Lohrey, Dietrich Kuske, Jiamou Liu, 2010, Ann. Pure Appl. Log..

On random relational structures

Manfred Droste, Dietrich Kuske, M. Droste, 2003, J. Comb. Theory, Ser. A.

Symmetries of the Partial Order of Traces

Dietrich Kuske, 1999, Order.

On Presburger Arithmetic Extended with Modulo Counting Quantifiers

Dietrich Kuske, Peter Habermehl, 2015, FoSSaCS.

Divisibility Monoids: Presentation, Word Problem, and Rational Languages

Dietrich Kuske, 2001, FCT.

Representation of Computations in Concurrent Automata by Dependence Orders

Manfred Droste, Dietrich Kuske, Felipe Bracho, 1997, Theor. Comput. Sci..

Euler paths and ends in automatic and recursive graphs

Markus Lohrey, Dietrich Kuske, 2008, AFL.

Hanf normal form for first-order logic with unary counting quantifiers

Nicole Schweikardt, Dietrich Kuske, Lucas Heimberg, 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

Theories of Automatic Structures and Their Complexity

Dietrich Kuske, 2009, CAI.

Propositional Dynamic Logic for Message-Passing Systems

Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke, 2007, FSTTCS.

Decidable First-Order Theories of One-Step Rewriting in Trace Monoids

Markus Lohrey, Dietrich Kuske, D. Kuske, 2004, Theory of Computing Systems.

The Isomorphism Problem on Classes of Automatic Structures

Markus Lohrey, Dietrich Kuske, Jiamou Liu, 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

On Recognizable Languages in Divisibility Monoids

Manfred Droste, Dietrich Kuske, 1999, FCT.

Muller message-passing automata and logics

Benedikt Bollig, Dietrich Kuske, D. Kuske, 2008, Inf. Comput..

Dependence Orders for Computations of Concurrent Automata

Manfred Droste, Dietrich Kuske, Felipe Bracho, 1995, STACS.

On Communicating Automata with Bounded Channels

Anca Muscholl, Dietrich Kuske, Blaise Genest, 2007, Fundam. Informaticae.

Second-Order Finite Automata: Expressive Power and Simple Proofs Using Automatic Structures

Dietrich Kuske, 2021, DLT.

Weighted automata

Manfred Droste, Dietrich Kuske, 2012 .

IS RAMSEY'S THEOREM ω- AUTOMATIC?

Dietrich Kuske, D. Kuske, 2010 .

On Recognizable Languages in Left Divisibility Monoids

Manfred Droste, Dietrich Kuske, M. Droste, 1998 .

On Graph Products of Automatic and Biautomatic Monoids

Dietrich Kuske, Egbert Fohry, 2006 .

SOME RELATIVES OF AUTOMATIC AND HYPERBOLIC GROUPS

Friedrich Otto, Dietrich Kuske, Michael Hoffmann, 2002 .

The isomorphism problem on classes of automatic structures with transitive relations

Markus Lohrey, Dietrich Kuske, Jiamou Liu, 2013 .

Generic automorphisms of the universal partial order

John K. Truss, Dietrich Kuske, D. Kuske, 2000 .

Singular Artin monoids of finite coxeter type are automatic

Dietrich Kuske, Michael Hoffmann, Ruth Corran, 2011 .

Distributive lattices with a decidable monadic second order theory

Dietrich Kuske, 2002 .

Traces, Series-Parallel Posets, and Pictures: A Weighted Study

Ina Fichtner, Dietrich Kuske, Ingmar Meinecke, 2009 .

The monoid of queue actions

Georg Zetzsche, Dietrich Kuske, Martin Huschenbett, 2017 .

Distributed Muller Automata and Logics

Benedikt Bollig, Dietrich Kuske, D. Kuske, 2006 .