Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDietrich Kuske
Person information
- affiliation: TU Ilmenau, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j43]Dietrich Kuske, Christian Schwarz:
Alternating complexity of counting first-order logic for the subword order. Acta Informatica 60(1): 79-100 (2023)- [j42]Peter Habermehl, Dietrich Kuske:
On Presburger arithmetic extended with non-unary counting quantifiers. Log. Methods Comput. Sci. 19(3) (2023) - [c64]Chris Köcher
, Dietrich Kuske:
Forwards- and Backwards-Reachability for Cooperating Multi-pushdown Systems. FCT 2023: 318-332 - 2022
- [i17]Peter Habermehl, Dietrich Kuske:
On Presburger arithmetic extended with non-unary counting quantifiers. CoRR abs/2204.03903 (2022) - 2021
- [c63]Dietrich Kuske:
Second-Order Finite Automata: Expressive Power and Simple Proofs Using Automatic Structures. DLT 2021: 242-254 - [p2]Manfred Droste, Dietrich Kuske:
Weighted automata. Handbook of Automata Theory (I.) 2021: 113-150 - [p1]Dietrich Kuske, Anca Muscholl:
Communicating automata. Handbook of Automata Theory (II.) 2021: 1147-1188 - 2020
- [c62]Dietrich Kuske:
The Subtrace Order and Counting First-Order Logic. CSR 2020: 289-302 - [c61]Dietrich Kuske, Christian Schwarz:
Complexity of Counting First-Order Logic for the Subword Order. MFCS 2020: 61:1-61:12
2010 – 2019
- 2019
- [c60]Dietrich Kuske, Georg Zetzsche:
Languages Ordered by the Subword Order. FoSSaCS 2019: 348-364 - [i16]Dietrich Kuske, Georg Zetzsche:
Languages ordered by the subword order. CoRR abs/1901.02194 (2019) - 2018
- [j41]Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes:
Multi-buffer simulations: Decidability and complexity. Inf. Comput. 262: 280-310 (2018) - [j40]Chris Köcher, Dietrich Kuske, Olena Prianychnykova:
The inclusion structure of partially lossy queue monoids and their trace submonoids. RAIRO Theor. Informatics Appl. 52(1): 55-86 (2018) - [j39]Dietrich Kuske, Jiamou Liu, Anastasia Moskvina:
Infinite and Bi-infinite Words with Decidable Monadic Theories. Log. Methods Comput. Sci. 14(3) (2018) - [c59]Faried Abu Zaid, Dietrich Kuske, Peter Lindner:
Climbing up the Elementary Complexity Classes with Theories of Automatic Structures. CSL 2018: 3:1-3:16 - [c58]Dietrich Kuske, Nicole Schweikardt:
Gaifman Normal Forms for Counting Extensions of First-Order Logic. ICALP 2018: 133:1-133:14 - 2017
- [j38]Georg Zetzsche, Dietrich Kuske, Markus Lohrey:
On Boolean Closed Full Trios and Rational Kripke Frames. Theory Comput. Syst. 60(3): 438-472 (2017) - [j37]Benedikt Bollig, Dietrich Kuske, Roy Mennicke:
The Complexity of Model Checking Multi-Stack Systems. Theory Comput. Syst. 60(4): 695-736 (2017) - [c57]Chris Köcher, Dietrich Kuske:
The Transformation Monoid of a Partially Lossy Queue. CSR 2017: 191-205 - [c56]Dietrich Kuske, Nicole Schweikardt:
First-order logic with counting. LICS 2017: 1-12 - [i15]Dietrich Kuske, Nicole Schweikardt:
First-Order Logic with Counting: At Least, Weak Hanf Normal Forms Always Exist and Can Be Computed! CoRR abs/1703.01122 (2017) - [i14]Dietrich Kuske, Jiamou Liu, Anastasia Moskvina:
Infinite and Bi-infinite Words with Decidable Monadic Theories. CoRR abs/1712.03759 (2017) - 2016
- [c55]Dietrich Kuske, Olena Prianychnykova:
The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids. DLT 2016: 256-267 - [c54]Lucas Heimberg, Dietrich Kuske, Nicole Schweikardt:
Hanf normal form for first-order logic with unary counting quantifiers. LICS 2016: 277-286 - [c53]Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes:
Two-Buffer Simulation Games. Cassting/SynCoP 2016: 27-38 - [c52]Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes:
Multi-Buffer Simulations for Trace Language Inclusion. GandALF 2016: 213-227 - [i13]Dietrich Kuske, Olena Prianychnykova:
The trace monoids in the queue monoid and in the direct product of two free monoids. CoRR abs/1603.07217 (2016) - 2015
- [c51]Dietrich Kuske, Jiamou Liu, Anastasia Moskvina:
Infinite and Bi-infinite Words with Decidable Monadic Theories. CSL 2015: 472-486 - [c50]Peter Habermehl, Dietrich Kuske:
On Presburger Arithmetic Extended with Modulo Counting Quantifiers. FoSSaCS 2015: 375-389 - 2014
- [j36]Dietrich Kuske:
Isomorphisms of scattered automatic linear orders. Theor. Comput. Sci. 533: 46-63 (2014) - [c49]Martin Huschenbett, Dietrich Kuske, Georg Zetzsche:
The Monoid of Queue Actions. MFCS (1) 2014: 340-351 - [i12]Martin Huschenbett, Dietrich Kuske, Georg Zetzsche:
The monoid of queue actions. CoRR abs/1404.5479 (2014) - 2013
- [j35]Dietrich Kuske, Jiamou Liu, Markus Lohrey:
The isomorphism problem for ω-automatic trees. Ann. Pure Appl. Log. 164(1): 30-48 (2013) - [j34]Ruth Corran, Michael Hoffmann, Dietrich Kuske, Richard M. Thomas:
On the automaticity of singular Artin monoids of finite type. Int. J. Comput. Math. 90(6): 1197-1222 (2013) - [c48]Lucas Heimberg, Dietrich Kuske, Nicole Schweikardt:
An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree. LICS 2013: 63-72 - [c47]Benedikt Bollig, Dietrich Kuske, Roy Mennicke:
The Complexity of Model Checking Multi-stack Systems. LICS 2013: 163-172 - [c46]Dietrich Kuske:
Logical Aspects of the Lexicographic Order on 1-Counter Languages. MFCS 2013: 619-630 - 2012
- [j33]Benedikt Bollig, Dietrich Kuske:
An optimal construction of Hanf sentences. J. Appl. Log. 10(2): 179-186 (2012) - [c45]Dietrich Kuske:
Isomorphisms of scattered automatic linear orders. CSL 2012: 455-469 - [i11]Dietrich Kuske:
Isomorphisms of scattered automatic linear orders. CoRR abs/1204.5653 (2012) - 2011
- [j32]Dietrich Kuske, Ingmar Meinecke:
Construction of tree automata from regular expressions. RAIRO Theor. Informatics Appl. 45(3): 347-370 (2011) - [j31]Dietrich Kuske, Markus Lohrey:
Automatic structures of bounded degree revisited. J. Symb. Log. 76(4): 1352-1380 (2011) - [c44]Dietrich Kuske:
Where Automatic Structures Benefit from Weighted Automata. Algebraic Foundations in Computer Science 2011: 257-271 - [c43]Ruth Corran, Michael Hoffmann, Dietrich Kuske, Richard M. Thomas:
Singular Artin Monoids of Finite Coxeter Type Are Automatic. LATA 2011: 250-261 - [c42]Dietrich Kuske, Thomas Weidner:
Size and Computation of Injective Tree Automatic Presentations. MFCS 2011: 424-435 - [i10]Benedikt Bollig, Dietrich Kuske:
An optimal construction of Hanf sentences. CoRR abs/1105.5487 (2011) - 2010
- [j30]Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke:
Propositional Dynamic Logic for Message-Passing Systems. Log. Methods Comput. Sci. 6(3) (2010) - [j29]Paul Gastin, Dietrich Kuske:
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces. Inf. Comput. 208(7): 797-816 (2010) - [j28]Dietrich Kuske, Markus Lohrey:
Some natural decision problems in automatic graphs. J. Symb. Log. 75(2): 678-710 (2010) - [c41]Dietrich Kuske, Jiamou Liu, Markus Lohrey:
The Isomorphism Problem for omega-Automatic Trees. CSL 2010: 396-410 - [c40]Dietrich Kuske, Jiamou Liu, Markus Lohrey:
The Isomorphism Problem on Classes of Automatic Structures. LICS 2010: 160-169 - [c39]Dietrich Kuske:
Is Ramsey's Theorem omega-automatic?. STACS 2010: 537-548 - [i9]Dietrich Kuske, Jiamou Liu, Markus Lohrey:
The Isomorphism Problem On Classes of Automatic Structures. CoRR abs/1001.2086 (2010) - [i8]Dietrich Kuske, Jiamou Liu, Markus Lohrey:
The Isomorphism Problem for omega-Automatic Trees. CoRR abs/1004.0610 (2010)
2000 – 2009
- 2009
- [j27]Dietrich Kuske:
Weighted and Unweighted Trace Automata. Acta Cybern. 19(2): 393-410 (2009) - [c38]Dietrich Kuske:
(Un)countable and (Non)effective Versions of Ramsey's Theorem. AMS-ASL Joint Special Session 2009: 467-488 - [c37]Dietrich Kuske:
Theories of Automatic Structures and Their Complexity. CAI 2009: 81-98 - [c36]Dietrich Kuske, Markus Lohrey:
Automatic Structures of Bounded Degree Revisited. CSL 2009: 364-378 - [i7]Dietrich Kuske:
Is Ramsey's theorem omega-automatic? CoRR abs/0912.2625 (2009) - 2008
- [j26]Benedikt Bollig, Dietrich Kuske:
Muller message-passing automata and logics. Inf. Comput. 206(9-10): 1084-1094 (2008) - [j25]Dietrich Kuske, Markus Lohrey:
First-order and counting theories of omega-automatic structures. J. Symb. Log. 73(1): 129-150 (2008) - [j24]Dietrich Kuske:
Schützenberger's theorem on formal power series follows from Kleene's theorem. Theor. Comput. Sci. 401(1-3): 243-248 (2008) - [c35]Dietrich Kuske, Markus Lohrey:
Euler paths and ends in automatic and recursive graphs. AFL 2008: 245-256 - [c34]Dietrich Kuske, Ingmar Meinecke:
Construction of Tree Automata from Regular Expressions. Developments in Language Theory 2008: 491-503 - [c33]Dietrich Kuske, Markus Lohrey:
Hamiltonicity of automatic graphs. IFIP TCS 2008: 445-459 - [c32]Dietrich Kuske:
Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic. STACS 2008: 467-478 - [e1]Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi:
Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007. Dagstuhl Seminar Proceedings 07441, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 [contents] - [i6]Dietrich Kuske:
Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic. CoRR abs/0802.2862 (2008) - [i5]Dietrich Kuske, Markus Lohrey:
Automatic structures of bounded degree revisited. CoRR abs/0810.4998 (2008) - 2007
- [j23]Blaise Genest, Dietrich Kuske, Anca Muscholl:
On Communicating Automata with Bounded Channels. Fundam. Informaticae 80(1-3): 147-167 (2007) - [j22]Paul Gastin, Dietrich Kuske:
Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces. Fundam. Informaticae 80(1-3): 169-197 (2007) - [j21]Dietrich Kuske:
Weighted asynchronous cellular automata. Theor. Comput. Sci. 374(1-3): 127-148 (2007) - [c31]Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke:
Propositional Dynamic Logic for Message-Passing Systems. FSTTCS 2007: 303-315 - [c30]Benedikt Bollig, Dietrich Kuske:
Muller Message-Passing Automata and Logics. LATA 2007: 163-174 - [c29]Manfred Droste, Dietrich Kuske:
Almost Every Domain is Universal. MFPS 2007: 103-119 - [i4]Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi:
07441 Summary -- Algorithmic-Logical Theory of Infinite Structures. Algorithmic-Logical Theory of Infinite Structures 2007 - [i3]Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi:
07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures. Algorithmic-Logical Theory of Infinite Structures 2007 - [i2]Dietrich Kuske:
Compatibility of Shelah and Stupp's and of Muchnik's iteration with fragments of monadic second order logic. Algorithmic-Logical Theory of Infinite Structures 2007 - 2006
- [j20]Blaise Genest, Dietrich Kuske, Anca Muscholl:
A Kleene theorem and model checking algorithms for existentially bounded communicating automata. Inf. Comput. 204(6): 920-956 (2006) - [j19]Dietrich Kuske, Markus Lohrey:
Logical Aspects of Cayley-graphs: the Monoid Case. Int. J. Algebra Comput. 16(2): 307-340 (2006) - [j18]Dietrich Kuske:
Theories of orders on the set of words. RAIRO Theor. Informatics Appl. 40(1): 53-74 (2006) - [j17]Manfred Droste, Dietrich Kuske:
Skew and infinitary formal power series. Theor. Comput. Sci. 366(3): 199-227 (2006) - [c28]Dietrich Kuske, Markus Lohrey:
First-Order and Counting Theories of omega-Automatic Structures. FoSSaCS 2006: 322-336 - [c27]Dietrich Kuske, Markus Lohrey:
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems. LICS 2006: 91-100 - [c26]Dietrich Kuske:
Weighted Asynchronous Cellular Automata. STACS 2006: 684-695 - 2005
- [j16]Dietrich Kuske, Markus Lohrey:
Logical aspects of Cayley-graphs: the group case. Ann. Pure Appl. Log. 131(1-3): 263-286 (2005) - [j15]Dietrich Kuske, Markus Lohrey:
Decidable First-Order Theories of One-Step Rewriting in Trace Monoids. Theory Comput. Syst. 38(1): 39-81 (2005) - [c25]Paul Gastin, Dietrich Kuske:
Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces. CONCUR 2005: 533-547 - [c24]Blaise Genest, Dietrich Kuske, Anca Muscholl, Doron A. Peled:
Snapshot Verification. TACAS 2005: 510-525 - 2004
- [j14]Dietrich Kuske, Ingmar Meinecke:
Branching automata with costs - a way of reflecting parallelism in costs star. Theor. Comput. Sci. 328(1-2): 53-75 (2004) - [c23]Blaise Genest, Anca Muscholl, Dietrich Kuske:
A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms. Developments in Language Theory 2004: 30-48 - [c22]Dietrich Kuske, Peter Weigel:
The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems. Developments in Language Theory 2004: 272-283 - 2003
- [j13]Dietrich Kuske:
Regular sets of infinite message sequence charts. Inf. Comput. 187(1): 80-109 (2003) - [j12]Manfred Droste, Dietrich Kuske:
On random relational structures. J. Comb. Theory, Ser. A 102(2): 241-254 (2003) - [j11]Dietrich Kuske:
Towards a language theory for infinite N-free pomsets. Theor. Comput. Sci. 299(1-3): 347-386 (2003) - [j10]Ralph Kummetz, Dietrich Kuske:
The topology of Mazurkiewicz traces. Theor. Comput. Sci. 305(1-3): 237-258 (2003) - [c21]Paul Gastin, Dietrich Kuske:
Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE. CONCUR 2003: 218-232 - [c20]Manfred Droste, Dietrich Kuske:
Skew and Infinitary Formal Power Series. ICALP 2003: 426-438 - [c19]Dietrich Kuske:
Is Cantor's Theorem Automatic? LPAR 2003: 332-345 - [c18]Dietrich Kuske, Markus Lohrey:
Decidable Theories of Cayley-Graphs. STACS 2003: 463-474 - [c17]Dietrich Kuske, Ingmar Meinecke:
Branching Automata with Costs - A Way of Reflecting Parallelism in Costs. CIAA 2003: 150-162 - 2002
- [j9]Dietrich Kuske, Rémi Morin:
Pomsets for Local Trace Languages. J. Autom. Lang. Comb. 7(2): 187-224 (2002) - [c16]Dietrich Kuske, Markus Lohrey:
On the Theory of One-Step Rewriting in Trace Monoids. ICALP 2002: 752-763 - [c15]Dietrich Kuske:
A Further Step towards a Theory of Regular MSC Languages. STACS 2002: 489-500 - 2001
- [j8]Manfred Droste, Dietrich Kuske:
Recognizable languages in divisibility monoids. Math. Struct. Comput. Sci. 11(6): 743-770 (2001) - [c14]Dietrich Kuske:
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable. Developments in Language Theory 2001: 206-216 - [c13]Dietrich Kuske:
Divisibility Monoids: Presentation, Word Problem, and Rational Languages. FCT 2001: 227-239 - [c12]Dietrich Kuske:
A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets. STACS 2001: 443-454 - 2000
- [b2]Dietrich Kuske:
Contributions to a trace theory beyond Mazurkiewicz traces. Dresden University of Technology, Germany, 2000, pp. 1-181 - [j7]Manfred Droste, Paul Gastin, Dietrich Kuske:
Asynchronous cellular automata for pomsets. Theor. Comput. Sci. 247(1-2): 1-38 (2000) - [c11]Dietrich Kuske, Rémi Morin:
Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets. CONCUR 2000: 426-441 - [c10]Dietrich Kuske:
Emptiness Is Decidable for Asynchronous Cellular Machines. CONCUR 2000: 536-551 - [c9]Dietrich Kuske:
Infinite Series-Parallel Posets: Logic and Languages. ICALP 2000: 648-662 - [c8]Steffen Hölldobler, Dietrich Kuske:
The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus. LPAR 2000: 436-450
1990 – 1999
- 1999
- [j6]Bernd Borchert, Dietrich Kuske, Frank Stephan:
On existentially first-order definable languages and their relation to NP. RAIRO Theor. Informatics Appl. 33(3): 259-270 (1999) - [j5]Manfred Droste, Dietrich Kuske, John Kenneth Truss:
On Homogeneous Semilattices and Their Automorphism Groups. Order 16(1): 31-56 (1999) - [j4]Dietrich Kuske:
Symmetries of the Partial Order of Traces. Order 16(2): 133-148 (1999) - [c7]Manfred Droste, Dietrich Kuske:
On Recognizable Languages in Divisibility Monoids. FCT 1999: 246-257 - 1998
- [j3]Dietrich Kuske, R. M. Shortt:
Topology for Computations of Concurrent Automata. Int. J. Algebra Comput. 8(3): 327-362 (1998) - [j2]Manfred Droste, Dietrich Kuske:
Recognizable and Logically Definable Languages of Infinite Computations in Concurrent Automata. Int. J. Found. Comput. Sci. 9(3): 295-314 (1998) - [c6]Dietrich Kuske:
Asynchronous Cellular Automata and Asynchronous Automata for Pomsets. CONCUR 1998: 517-532 - [c5]Bernd Borchert, Dietrich Kuske, Frank Stephan:
On Existentially First-Order Definable Languages and Their Relation to NP. ICALP 1998: 17-28 - 1997
- [j1]Felipe Bracho, Manfred Droste, Dietrich Kuske:
Representation of Computations in Concurrent Automata by Dependence Orders. Theor. Comput. Sci. 174(1-2): 67-96 (1997) - [i1]