Dietrich Kuske

From MaRDI portal
(Redirected from Person:219059)
Person:420855

Available identifiers

zbMath Open kuske.dietrichMaRDI QIDQ420855

List of research outcomes





PublicationDate of PublicationType
Backwards-reachability for cooperating multi-pushdown systems2024-12-27Paper
Languages and logical definability in concurrency monoids2024-06-21Paper
Forwards- and backwards-reachability for cooperating multi-pushdown systems2024-05-29Paper
On Presburger arithmetic extended with non-unary counting quantifiers2023-08-26Paper
Alternating complexity of counting first-order logic for the subword order2023-03-01Paper
The Subtrace Order and Counting First-Order Logic2022-10-19Paper
https://portal.mardi4nfdi.de/entity/Q50892322022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50797232022-05-28Paper
Traces, Series-Parallel Posets, and Pictures: A Weighted Study2022-04-28Paper
Second-order finite automata: expressive power and simple proofs using automatic structures2022-03-25Paper
Weighted automata2022-02-04Paper
https://portal.mardi4nfdi.de/entity/Q50152802021-12-07Paper
Communicating automata2021-11-12Paper
https://portal.mardi4nfdi.de/entity/Q50028202021-07-28Paper
https://portal.mardi4nfdi.de/entity/Q51446802021-01-19Paper
Languages ordered by the subword order2020-01-28Paper
The inclusion structure of partially lossy queue monoids and their trace submonoids2018-11-01Paper
Multi-buffer simulations: decidability and complexity2018-09-27Paper
https://portal.mardi4nfdi.de/entity/Q45850662018-09-06Paper
Hanf normal form for first-order logic with unary counting quantifiers2018-04-23Paper
The monoid of queue actions2018-02-28Paper
Dependence orders for computations of concurrent automata2017-12-04Paper
Infinite and Bi-infinite Words with Decidable Monadic Theories.2017-08-31Paper
The transformation monoid of a partially lossy queue2017-08-22Paper
The complexity of model checking multi-stack systems2017-08-15Paper
On Boolean closed full trios and rational Kripke frames2017-07-17Paper
The Complexity of Model Checking Multi-stack Systems2017-07-03Paper
An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree2017-07-03Paper
The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids2016-08-30Paper
On Presburger Arithmetic Extended with Modulo Counting Quantifiers2015-10-01Paper
Almost Every Domain is Universal2015-07-10Paper
RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA2015-04-29Paper
The Monoid of Queue Actions2014-10-14Paper
Isomorphisms of scattered automatic linear orders2014-04-16Paper
On the automaticity of singular Artin monoids of finite type2013-10-22Paper
Logical Aspects of the Lexicographic Order on 1-Counter Languages2013-09-20Paper
The isomorphism problem on classes of automatic structures with transitive relations2013-09-04Paper
https://portal.mardi4nfdi.de/entity/Q49107422013-03-19Paper
Isomorphisms of scattered automatic linear orders.2012-11-22Paper
The isomorphism problem for \(\omega \)-automatic trees2012-11-20Paper
An optimal construction of Hanf sentences2012-05-23Paper
https://portal.mardi4nfdi.de/entity/Q31183912012-03-02Paper
Is Ramsey's theorem omega-automatic?2012-01-23Paper
Automatic structures of bounded degree revisited2011-12-23Paper
Where Automatic Structures Benefit from Weighted Automata2011-11-11Paper
Construction of tree automata from regular expressions2011-10-28Paper
Size and Computation of Injective Tree Automatic Presentations2011-08-17Paper
https://portal.mardi4nfdi.de/entity/Q30771922011-02-22Paper
Propositional dynamic logic for message-passing systems2010-09-21Paper
The Isomorphism Problem for ω-Automatic Trees2010-09-03Paper
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces2010-08-18Paper
Some natural decision problems in automatic graphs2010-06-24Paper
Branching Automata with Costs — A Way of Reflecting Parallelism in Costs2010-05-07Paper
CONCUR 2003 - Concurrency Theory2010-03-30Paper
https://portal.mardi4nfdi.de/entity/Q34081482010-02-24Paper
Automatic Structures of Bounded Degree Revisited2009-11-12Paper
Theories of Automatic Structures and Their Complexity2009-11-05Paper
Weighted asynchronous cellular automata2009-06-22Paper
Construction of Tree Automata from Regular Expressions2008-10-30Paper
Muller message-passing automata and logics2008-10-08Paper
Schützenberger's theorem on formal power series follows from Kleene's theorem2008-07-31Paper
https://portal.mardi4nfdi.de/entity/Q35043442008-06-11Paper
https://portal.mardi4nfdi.de/entity/Q35043432008-06-11Paper
First-order and counting theories ofω-automatic structures2008-05-08Paper
Propositional Dynamic Logic for Message-Passing Systems2008-04-24Paper
Weighted Asynchronous Cellular Automata2008-03-19Paper
https://portal.mardi4nfdi.de/entity/Q54319182008-01-02Paper
https://portal.mardi4nfdi.de/entity/Q54319172008-01-02Paper
Foundations of Software Science and Computation Structures2007-05-02Paper
Skew and infinitary formal power series2007-01-09Paper
CONCUR 2005 – Concurrency Theory2006-11-01Paper
On graph products of automatic and biautomatic monoids.2006-09-12Paper
https://portal.mardi4nfdi.de/entity/Q54859732006-09-06Paper
LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE2006-08-14Paper
A Kleene theorem and model checking algorithms for existentially bounded communicating automata2006-07-12Paper
Theories of orders on the set of words2006-02-22Paper
Developments in Language Theory2005-12-22Paper
Developments in Language Theory2005-12-22Paper
Tools and Algorithms for the Construction and Analysis of Systems2005-11-10Paper
Distributive lattices with a decidable monadic second order theory.2005-04-19Paper
Decidable first-order theories of one-step rewriting in trace monoids2005-02-24Paper
Logical aspects of Cayley-graphs: the group case2005-01-31Paper
Branching automata with costs -- a way of reflecting parallelism in costs2005-01-11Paper
Regular sets of infinite message sequence charts2004-11-23Paper
https://portal.mardi4nfdi.de/entity/Q47372052004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47379082004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47368652004-08-11Paper
The topology of Mazurkiewicz traces.2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44491932004-02-08Paper
https://portal.mardi4nfdi.de/entity/Q44186732003-08-11Paper
On random relational structures2003-07-01Paper
https://portal.mardi4nfdi.de/entity/Q48078312003-05-26Paper
Towards a language theory for infinite N-free pomsets.2003-05-25Paper
https://portal.mardi4nfdi.de/entity/Q47827122002-12-02Paper
https://portal.mardi4nfdi.de/entity/Q45366262002-11-28Paper
https://portal.mardi4nfdi.de/entity/Q45366182002-11-28Paper
https://portal.mardi4nfdi.de/entity/Q27670362002-07-22Paper
Recognizable languages in divisibility monoids2002-06-05Paper
https://portal.mardi4nfdi.de/entity/Q27625232002-01-09Paper
Complementary closed relational clones are not always Krasner clones2001-12-16Paper
https://portal.mardi4nfdi.de/entity/Q27541842001-11-11Paper
Generic automorphisms of the universal partial order2001-05-14Paper
On Existentially First-Order Definable Languages and Their Relation to NP2000-12-06Paper
Asynchronous cellular automata for pomsets2000-10-26Paper
https://portal.mardi4nfdi.de/entity/Q42519232000-10-17Paper
On homogeneous semilattices and their automorphism groups2000-10-08Paper
Symmetries of the partial order of traces2000-06-21Paper
https://portal.mardi4nfdi.de/entity/Q49544512000-06-07Paper
https://portal.mardi4nfdi.de/entity/Q49343332000-01-17Paper
https://portal.mardi4nfdi.de/entity/Q42317801999-03-15Paper
Representation of computations in concurrent automata by dependence orders1998-10-22Paper
Topology for Computations of Concurrent Automata1997-09-15Paper
https://portal.mardi4nfdi.de/entity/Q48672921996-02-28Paper

Research outcomes over time

This page was built for person: Dietrich Kuske