The following pages link to Dietrich Kuske (Q420855):
Displaying 50 items.
- (Q219059) (redirect page) (← links)
- An optimal construction of Hanf sentences (Q420856) (← links)
- Branching automata with costs -- a way of reflecting parallelism in costs (Q703495) (← links)
- Logical aspects of Cayley-graphs: the group case (Q705541) (← links)
- Second-order finite automata: expressive power and simple proofs using automatic structures (Q832943) (← links)
- Skew and infinitary formal power series (Q860889) (← links)
- Schützenberger's theorem on formal power series follows from Kleene's theorem (Q935170) (← links)
- Muller message-passing automata and logics (Q948076) (← links)
- Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces (Q988553) (← links)
- Weighted asynchronous cellular automata (Q1022595) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- On random relational structures (Q1395812) (← links)
- The topology of Mazurkiewicz traces. (Q1427782) (← links)
- Symmetries of the partial order of traces (Q1568667) (← links)
- Asynchronous cellular automata for pomsets (Q1583242) (← links)
- The monoid of queue actions (Q1702520) (← links)
- The isomorphism problem for \(\omega \)-automatic trees (Q1759366) (← links)
- Decidable first-order theories of one-step rewriting in trace monoids (Q1764424) (← links)
- Distributive lattices with a decidable monadic second order theory. (Q1771945) (← links)
- Multi-buffer simulations: decidability and complexity (Q1784963) (← links)
- Towards a language theory for infinite N-free pomsets. (Q1874399) (← links)
- Regular sets of infinite message sequence charts (Q1887140) (← links)
- On homogeneous semilattices and their automorphism groups (Q1970932) (← links)
- Weighted automata (Q2074206) (← links)
- Communicating automata (Q2244826) (← links)
- Languages ordered by the subword order (Q2289086) (← links)
- On Boolean closed full trios and rational Kripke frames (Q2363961) (← links)
- The complexity of model checking multi-stack systems (Q2398213) (← links)
- The transformation monoid of a partially lossy queue (Q2399374) (← links)
- Isomorphisms of scattered automatic linear orders (Q2446106) (← links)
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata (Q2496297) (← links)
- On graph products of automatic and biautomatic monoids. (Q2502268) (← links)
- Alternating complexity of counting first-order logic for the subword order (Q2687036) (← links)
- Generic automorphisms of the universal partial order (Q2718953) (← links)
- (Q2754184) (← links)
- (Q2762523) (← links)
- (Q2767036) (← links)
- Propositional Dynamic Logic for Message-Passing Systems (Q2786133) (← links)
- The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids (Q2817393) (← links)
- The isomorphism problem on classes of automatic structures with transitive relations (Q2847190) (← links)
- Logical Aspects of the Lexicographic Order on 1-Counter Languages (Q2849948) (← links)
- The Monoid of Queue Actions (Q2922028) (← links)
- On Presburger Arithmetic Extended with Modulo Counting Quantifiers (Q2949452) (← links)
- (Q3077192) (← links)
- Size and Computation of Injective Tree Automatic Presentations (Q3088059) (← links)
- Construction of tree automata from regular expressions (Q3095043) (← links)
- Where Automatic Structures Benefit from Weighted Automata (Q3098042) (← links)
- Automatic structures of bounded degree revisited (Q3107359) (← links)
- Is Ramsey's theorem omega-automatic? (Q3113778) (← links)
- (Q3118391) (← links)
