Dietrich Kuske

According to our database1, Dietrich Kuske authored at least 96 papers between 1993 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Languages Ordered by the Subword Order.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

2018
The inclusion structure of partially lossy queue monoids and their trace submonoids.
RAIRO - Theor. Inf. and Applic., 2018

Multi-buffer simulations: Decidability and complexity.
Inf. Comput., 2018

Gaifman Normal Forms for Counting Extensions of First-Order Logic.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Climbing up the Elementary Complexity Classes with Theories of Automatic Structures.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2017
On Boolean Closed Full Trios and Rational Kripke Frames.
Theory Comput. Syst., 2017

First-order logic with counting.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

The Transformation Monoid of a Partially Lossy Queue.
Proceedings of the Computer Science - Theory and Applications, 2017

2016
Two-Buffer Simulation Games.
Proceedings of the Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters and 3rd International Workshop on Synthesis of Complex Parameters, 2016

Multi-Buffer Simulations for Trace Language Inclusion.
Proceedings of the Seventh International Symposium on Games, 2016

Hanf normal form for first-order logic with unary counting quantifiers.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015
On Presburger Arithmetic Extended with Modulo Counting Quantifiers.
Proceedings of the Foundations of Software Science and Computation Structures, 2015

Infinite and Bi-infinite Words with Decidable Monadic Theories.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014
The Monoid of Queue Actions.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013
On the automaticity of singular Artin monoids of finite type.
Int. J. Comput. Math., 2013

The isomorphism problem for ω-automatic trees.
Ann. Pure Appl. Logic, 2013

Logical Aspects of the Lexicographic Order on 1-Counter Languages.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

The Complexity of Model Checking Multi-stack Systems.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2012
An optimal construction of Hanf sentences.
J. Applied Logic, 2012

Isomorphisms of scattered automatic linear orders.
Proceedings of the Computer Science Logic (CSL'12), 2012

2011
Size and Computation of Injective Tree Automatic Presentations.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Singular Artin Monoids of Finite Coxeter Type Are Automatic.
Proceedings of the Language and Automata Theory and Applications, 2011

Where Automatic Structures Benefit from Weighted Automata.
Proceedings of the Algebraic Foundations in Computer Science, 2011

2010
Some natural decision problems in automatic graphs.
J. Symb. Log., 2010

Propositional Dynamic Logic for Message-Passing Systems
Logical Methods in Computer Science, 2010

Is Ramsey's Theorem omega-automatic?.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

The Isomorphism Problem on Classes of Automatic Structures.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

The Isomorphism Problem for omega-Automatic Trees.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009
Weighted and Unweighted Trace Automata.
Acta Cybern., 2009

Automatic Structures of Bounded Degree Revisited.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

Theories of Automatic Structures and Their Complexity.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

2008
Schützenberger's theorem on formal power series follows from Kleene's theorem.
Theor. Comput. Sci., 2008

First-order and counting theories of omega-automatic structures.
J. Symb. Log., 2008

Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic.
Proceedings of the STACS 2008, 2008

Hamiltonicity of automatic graphs.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Construction of Tree Automata from Regular Expressions.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

Euler paths and ends in automatic and recursive graphs.
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007
On Communicating Automata with Bounded Channels.
Fundam. Inform., 2007

Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces.
Fundam. Inform., 2007

Almost Every Domain is Universal.
Electr. Notes Theor. Comput. Sci., 2007

Muller Message-Passing Automata and Logics.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Propositional Dynamic Logic for Message-Passing Systems.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Compatibility of Shelah and Stupp's and of Muchnik's iteration with fragments of monadic second order logic.
Proceedings of the Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007, 2007

07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures.
Proceedings of the Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007, 2007

07441 Summary -- Algorithmic-Logical Theory of Infinite Structures.
Proceedings of the Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007, 2007

2006
Theories of orders on the set of words.
ITA, 2006

Logical Aspects of Cayley-graphs: the Monoid Case.
IJAC, 2006

A Kleene theorem and model checking algorithms for existentially bounded communicating automata.
Inf. Comput., 2006

Weighted Asynchronous Cellular Automata.
Proceedings of the STACS 2006, 2006

Monadic Chain Logic Over Iterations and Applications to Pushdown Systems.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

First-Order and Counting Theories of omega-Automatic Structures.
Proceedings of the Foundations of Software Science and Computation Structures, 2006

2005
Decidable First-Order Theories of One-Step Rewriting in Trace Monoids.
Theory Comput. Syst., 2005

Logical aspects of Cayley-graphs: the group case.
Ann. Pure Appl. Logic, 2005

Snapshot Verification.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2005

Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004
Branching automata with costs - a way of reflecting parallelism in costs star.
Theor. Comput. Sci., 2004

The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems.
Proceedings of the Developments in Language Theory, 2004

A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms.
Proceedings of the Developments in Language Theory, 2004

2003
Towards a language theory for infinite N-free pomsets.
Theor. Comput. Sci., 2003

The topology of Mazurkiewicz traces.
Theor. Comput. Sci., 2003

On random relational structures.
J. Comb. Theory, Ser. A, 2003

Regular sets of infinite message sequence charts.
Inf. Comput., 2003

Branching Automata with Costs - A Way of Reflecting Parallelism in Costs.
Proceedings of the Implementation and Application of Automata, 2003

Decidable Theories of Cayley-Graphs.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Is Cantor's Theorem Automatic?
Proceedings of the Logic for Programming, 2003

Skew and Infinitary Formal Power Series.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE.
Proceedings of the CONCUR 2003, 2003

2002
Pomsets for Local Trace Languages.
Journal of Automata, Languages and Combinatorics, 2002

A Further Step towards a Theory of Regular MSC Languages.
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

On the Theory of One-Step Rewriting in Trace Monoids.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
Recognizable languages in divisibility monoids.
Mathematical Structures in Computer Science, 2001

A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets.
Proceedings of the STACS 2001, 2001

Divisibility Monoids: Presentation, Word Problem, and Rational Languages.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

2000
Contributions to a trace theory beyond Mazurkiewicz traces.
, 2000

Asynchronous cellular automata for pomsets.
Theor. Comput. Sci., 2000

The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus.
Proceedings of the Logic for Programming and Automated Reasoning, 2000

Infinite Series-Parallel Posets: Logic and Languages.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets.
Proceedings of the CONCUR 2000, 2000

Emptiness Is Decidable for Asynchronous Cellular Machines.
Proceedings of the CONCUR 2000, 2000

1999
Symmetries of the Partial Order of Traces.
Order, 1999

On Homogeneous Semilattices and Their Automorphism Groups.
Order, 1999

On Recognizable Languages in Divisibility Monoids.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998
Recognizable and Logically Definable Languages of Infinite Computations in Concurrent Automata.
Int. J. Found. Comput. Sci., 1998

Topology for Computations of Concurrent Automata.
IJAC, 1998

On Existentially First-Order Definable Languages and Their Relation to NP.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Asynchronous Cellular Automata and Asynchronous Automata for Pomsets.
Proceedings of the CONCUR '98: Concurrency Theory, 1998

1997
Representation of Computations in Concurrent Automata by Dependence Orders.
Theor. Comput. Sci., 1997

On Existentially First-Order Definable Languages and their Relation to NP
Electronic Colloquium on Computational Complexity (ECCC), 1997

1995
Dependence Orders for Computations of Concurrent Automata.
STACS, 1995

Trace Languages Definable with Modular Quantifiers.
Proceedings of the Developments in Language Theory II, 1995

Languages and Logical Definability in Concurrency Monoids.
Proceedings of the Computer Science Logic, 9th International Workshop, 1995

1994
Nondeterministic Automata with Concurrency Relations and Domains.
Proceedings of the Trees in Algebra and Programming, 1994

1993
Modelle nebenläufiger Prozesse - Monoide, Residuensysteme und Automaten.
PhD thesis, 1993


  Loading...