The following pages link to Georg Zetzsche (Q1675162):
Displaying 50 items.
- The emptiness problem for valence automata or: another decidable extension of Petri nets (Q1675163) (← links)
- The monoid of queue actions (Q1702520) (← links)
- Knapsack in graph groups (Q1702854) (← links)
- General decidability results for asynchronous shared-memory programs: higher-order and beyond (Q2044219) (← links)
- Closure properties of knapsack semilinear groups (Q2236107) (← links)
- Languages ordered by the subword order (Q2289086) (← links)
- Coverability Is undecidable in one-dimensional pushdown vector addition systems with resets (Q2330602) (← links)
- Rational subsets and submonoids of wreath products. (Q2347806) (← links)
- On Boolean closed full trios and rational Kripke frames (Q2363961) (← links)
- The emptiness problem for valence automata over graph monoids (Q2662504) (← links)
- Recent advances on reachability problems for valence systems (invited talk) (Q2695487) (← links)
- (Q2816503) (← links)
- Semilinearity and Context-Freeness of Languages Accepted by Valence Automata (Q2849913) (← links)
- The Monoid of Queue Actions (Q2922028) (← links)
- Computing Downward Closures for Stacked Counter Automata (Q2955038) (← links)
- On Boolean closed full trios and rational Kripke frames. (Q2965514) (← links)
- Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups (Q2975251) (← links)
- On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids (Q3012922) (← links)
- TOWARD UNDERSTANDING THE GENERATIVE CAPACITY OF ERASING RULES IN MATRIX GRAMMARS (Q3086247) (← links)
- Knapsack Problems for Wreath Products (Q3304131) (← links)
- An Approach to Computing Downward Closures (Q3449495) (← links)
- Labeled Step Sequences in Petri Nets (Q3510872) (← links)
- On Erasing Productions in Random Context Grammars (Q3587437) (← links)
- Erasing in Petri Net Languages and Matrix Grammars (Q3637250) (← links)
- (Q4560219) (← links)
- The Complexity of Downward Closure Comparisons (Q4598265) (← links)
- Knapsack in graph groups, HNN-extensions and amalgamated products (Q4601902) (← links)
- The complexity of regular abstractions of one-counter languages (Q4635876) (← links)
- First-order logic with reachability for infinite-state systems (Q4635903) (← links)
- The Complexity of Knapsack in Graph Groups (Q4636653) (← links)
- CONCURRENT FINITE AUTOMATA AND RELATED LANGUAGE CLASSES (AN OVERVIEW) (Q4922676) (← links)
- (Q4967224) (← links)
- Unboundedness Problems for Languages of Vector Addition Systems. (Q5002804) (← links)
- Bounded Context Switching for Valence Systems (Q5009426) (← links)
- General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond (Q5060187) (← links)
- (Q5089240) (← links)
- (Q5144688) (← links)
- Separability by piecewise testable languages and downward closures beyond subwords (Q5145372) (← links)
- Extensions of ω-Regular Languages (Q5145637) (← links)
- An Approach to Regular Separability in Vector Addition Systems (Q5145646) (← links)
- (Q5192935) (← links)
- (Q5192936) (← links)
- A Sufficient Condition for Erasing Productions to Be Avoidable (Q5199989) (← links)
- Silent Transitions in Automata with Storage (Q5327453) (← links)
- (Q5506359) (← links)
- (Q5506372) (← links)
- Regular Separability and Intersection Emptiness Are Independent Problems (Q5875690) (← links)
- Knapsack and the power word problem in solvable Baumslag–Solitar groups (Q6159137) (← links)
- Existential Definability over the Subword Ordering (Q6178718) (← links)
- Knapsack and the power word problem in solvable Baumslag-Solitar groups (Q6334498) (← links)
