Labeled Step Sequences in Petri Nets. - Matthias Jantzen; Georg Zetzsche (Petri Nets, 2008)

Petri Net Controlled Finite Automata. - Berndt Farwer; Matthias Jantzen; Manfred Kudlek; Heiko Rölke; Georg Zetzsche (Fundam. Informaticae, 2008)

Language Classes Defined by Concurrent Finite Automata. - Matthias Jantzen; Manfred Kudlek; Georg Zetzsche (Fundam. Informaticae, 2008)

Erasing in Petri Net Languages and Matrix Grammars. - Georg Zetzsche (Developments in Language Theory, 2009)

Multiset Pushdown Automata. - Manfred Kudlek; Patrick Totzke; Georg Zetzsche (Fundam. Informaticae, 2009)

Properties of Multiset Language Classes Defined by Multiset Pushdown Automata. - Manfred Kudlek; Patrick Totzke; Georg Zetzsche (Fundam. Informaticae, 2009)

On Erasing Productions in Random Context Grammars. - Georg Zetzsche (ICALP (2), 2010)

A Sufficient Condition for Erasing Productions to Be Avoidable. - Georg Zetzsche (Developments in Language Theory, 2011)

On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids. - Georg Zetzsche (ICALP (2), 2011)

Toward Understanding the Generative Capacity of Erasing Rules in Matrix Grammars. - Georg Zetzsche (Int. J. Found. Comput. Sci., 2011)

Silent Transitions in Automata with Storage. - Georg Zetzsche (ICALP (2), 2013)

Semilinearity and Context-Freeness of Languages Accepted by Valence Automata. - P. Buckheister; Georg Zetzsche (MFCS, 2013)

The Monoid of Queue Actions. - Martin Huschenbett; Dietrich Kuske; Georg Zetzsche (MFCS (1), 2014)

On Boolean closed full trios and rational Kripke frames. - Markus Lohrey; Georg Zetzsche (STACS, 2014)

An Approach to Computing Downward Closures. - Georg Zetzsche (ICALP (2), 2015)

The Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets. - Georg Zetzsche (RP, 2015)

Computing Downward Closures for Stacked Counter Automata. - Georg Zetzsche (STACS, 2015)

Rational subsets and submonoids of wreath products. - Markus Lohrey; Benjamin Steinberg; Georg Zetzsche (Inf. Comput., 2015)

Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. - Daniel König; Markus Lohrey; Georg Zetzsche (AMS-EMS-SPM Joint Meeting, 2016)

The Complexity of Downward Closure Comparisons. - Georg Zetzsche (ICALP, 2016)

The complexity of regular abstractions of one-counter languages. - Mohamed Faouzi Atig; Dmitry Chistikov 001; Piotr Hofman; K. Narayan Kumar; Prakash Saivasan; Georg Zetzsche (LICS, 2016)

First-order logic with reachability for infinite-state systems. - Emanuele D'Osualdo; Roland Meyer 001; Georg Zetzsche (LICS, 2016)

Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products. - Markus Lohrey; Georg Zetzsche (STACS, 2016)

Permutations of context-free, ET0L and indexed languages. - Tara Brough; Laura Ciobanu; Murray Elder; Georg Zetzsche (Discret. Math. Theor. Comput. Sci., 2016)

Monoids as Storage Mechanisms. - Georg Zetzsche (Bull. EATCS, 2016)

Monoids as Storage Mechanisms. - Georg Zetzsche (2016)

Decidability, complexity, and expressiveness of first-order logic over the subword ordering. - Simon Halfon; Philippe Schnoebelen; Georg Zetzsche (LICS, 2017)

The Complexity of Knapsack in Graph Groups. - Markus Lohrey; Georg Zetzsche (STACS, 2017)

A Characterization for Decidable Separability by Piecewise Testable Languages. - Wojciech Czerwinski; Wim Martens; Lorijn van Rooijen; Marc Zeitoun; Georg Zetzsche (Discret. Math. Theor. Comput. Sci., 2017)

On Boolean Closed Full Trios and Rational Kripke Frames. - Georg Zetzsche; Dietrich Kuske; Markus Lohrey (Theory Comput. Syst., 2017)

Bounded Context Switching for Valence Systems. - Roland Meyer 001; Sebastian Muskalla; Georg Zetzsche (CONCUR, 2018)

Unboundedness Problems for Languages of Vector Addition Systems. - Wojciech Czerwinski; Piotr Hofman; Georg Zetzsche (ICALP, 2018)

Separability by piecewise testable languages and downward closures beyond subwords. - Georg Zetzsche (LICS, 2018)

Knapsack Problems for Wreath Products. - Moses Ganardi; Daniel König; Markus Lohrey; Georg Zetzsche (STACS, 2018)

PTL-separability and closures for WQOs on words. - Georg Zetzsche (CoRR, 2018)

Knapsack in Graph Groups. - Markus Lohrey; Georg Zetzsche (Theory Comput. Syst., 2018)

Languages Ordered by the Subword Order. - Dietrich Kuske; Georg Zetzsche (FoSSaCS, 2019)

Regular Separability and Intersection Emptiness Are Independent Problems. - Ramanathan S. Thinniyam; Georg Zetzsche (FSTTCS, 2019)

Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests. - Christoph Haase; Georg Zetzsche (LICS, 2019)

Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets. - Sylvain Schmitz; Georg Zetzsche (RP, 2019)

The Complexity of Bounded Context Switching with Dynamic Thread Creation. - Pascal Baumann 001; Rupak Majumdar; Ramanathan S. Thinniyam; Georg Zetzsche (ICALP, 2020)

Rational Subsets of Baumslag-Solitar Groups. - Michaël Cadilhac; Dmitry Chistikov 001; Georg Zetzsche (ICALP, 2020)

The Complexity of Knapsack Problems in Wreath Products. - Michael Figelius; Moses Ganardi; Markus Lohrey; Georg Zetzsche (ICALP, 2020)

Extensions of ω-Regular Languages. - Mikolaj Bojanczyk; Edon Kelmendi; Rafal Stefanski; Georg Zetzsche (LICS, 2020)

An Approach to Regular Separability in Vector Addition Systems. - Wojciech Czerwinski; Georg Zetzsche (LICS, 2020)

Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups. - Markus Lohrey; Georg Zetzsche (MFCS, 2020)

Scope-Bounded Reachability in Valence Systems. - Aneesh K. Shetty; S. Krishna 004; Georg Zetzsche (CONCUR, 2021)

Recent Advances on Reachability Problems for Valence Systems (Invited Talk). - Georg Zetzsche (RP, 2021)

A Characterization of Wreath Products Where Knapsack Is Decidable. - Pascal Bergsträßer; Moses Ganardi; Georg Zetzsche (STACS, 2021)

The emptiness problem for valence automata over graph monoids. - Georg Zetzsche (Inf. Comput., 2021)

Context-bounded verification of liveness properties for multithreaded shared-memory programs. - Pascal Baumann 001; Rupak Majumdar; Ramanathan S. Thinniyam; Georg Zetzsche (Proc. ACM Program. Lang., 2021)

Reachability in Bidirected Pushdown VASS. - Moses Ganardi; Rupak Majumdar; Andreas Pavlogiannis; Lia Schütze; Georg Zetzsche (ICALP, 2022)

Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification. - Pascal Bergsträßer; Moses Ganardi; Anthony W. Lin; Georg Zetzsche (LICS, 2022)

The Complexity of Bidirected Reachability in Valence Systems. - Moses Ganardi; Rupak Majumdar; Georg Zetzsche (LICS, 2022)

Membership Problems in Finite Groups. - Markus Lohrey; Andreas Rosowski; Georg Zetzsche (MFCS, 2022)

General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond. - Rupak Majumdar; Ramanathan S. Thinniyam; Georg Zetzsche (Log. Methods Comput. Sci., 2022)

Context-bounded verification of thread pools. - Pascal Baumann 001; Rupak Majumdar; Ramanathan S. Thinniyam; Georg Zetzsche (Proc. ACM Program. Lang., 2022)

Monus Semantics in Vector Addition Systems with States. - Pascal Baumann 001; Khushraj Madnani; Filip Mazowiecki; Georg Zetzsche (CONCUR, 2023)

Priority Downward Closures. - Ashwani Anand; Georg Zetzsche (CONCUR, 2023)

Unboundedness Problems for Machines with Reversal-Bounded Counters. - Pascal Baumann 001; Flavio D'Alessandro; Moses Ganardi; Oscar H. Ibarra; Ian McQuillan; Lia Schütze; Georg Zetzsche (FoSSaCS, 2023)

Counter Machines with Infrequent Reversals. - Alain Finkel; Shankara Narayanan Krishna; Khushraj Madnani; Rupak Majumdar; Georg Zetzsche (FSTTCS, 2023)

Regular Separators for VASS Coverability Languages. - Chris Köcher; Georg Zetzsche (FSTTCS, 2023)

Context-Bounded Analysis of Concurrent Programs (Invited Talk). - Pascal Baumann 001; Moses Ganardi; Rupak Majumdar; Ramanathan S. Thinniyam; Georg Zetzsche (ICALP, 2023)

Checking Refinement of Asynchronous Programs Against Context-Free Specifications. - Pascal Baumann 001; Moses Ganardi; Rupak Majumdar; Ramanathan S. Thinniyam; Georg Zetzsche (ICALP, 2023)

Regular Separability in Büchi VASS. - Pascal Baumann 001; Roland Meyer 001; Georg Zetzsche (STACS, 2023)

Knapsack and the power word problem in solvable Baumslag-Solitar groups. - Moses Ganardi; Markus Lohrey; Georg Zetzsche (Int. J. Algebra Comput., 2023)

Existential Definability over the Subword Ordering. - Pascal Baumann 001; Moses Ganardi; Ramanathan S. Thinniyam; Georg Zetzsche (Log. Methods Comput. Sci., 2023)

Context-Bounded Verification of Context-Free Specifications. - Pascal Baumann 001; Moses Ganardi; Rupak Majumdar; Ramanathan S. Thinniyam; Georg Zetzsche (Proc. ACM Program. Lang., 2023)

Separability in Büchi VASS and Singly Non-Linear Systems of Inequalities. - Pascal Baumann 001; Eren Keskin; Roland Meyer 001; Georg Zetzsche (ICALP, 2024)

An Efficient Quantifier Elimination Procedure for Presburger Arithmetic. - Christoph Haase; Shankara Narayanan Krishna; Khushraj Madnani; Om Swostik Mishra; Georg Zetzsche (ICALP, 2024)

Verifying Unboundedness via Amalgamation. - Ashwani Anand; Sylvain Schmitz; Lia Schütze; Georg Zetzsche (LICS, 2024)

Slice closures of indexed languages and word equations with counting constraints. - Laura Ciobanu; Georg Zetzsche (LICS, 2024)

The Power of Hard Attention Transformers on Data Sequences: A formal language theoretic perspective. - Pascal Bergsträßer; Chris Köcher; Anthony Widjaja Lin; Georg Zetzsche (NeurIPS, 2024)

Directed Regular and Context-Free Languages. - Moses Ganardi; Irmak Saglam; Georg Zetzsche (STACS, 2024)

Reachability in Continuous Pushdown VASS. - A. R. Balasubramanian; Rupak Majumdar; Ramanathan S. Thinniyam; Georg Zetzsche (Proc. ACM Program. Lang., 2024)

Ramsey Quantifiers in Linear Arithmetics. - Pascal Bergsträßer; Moses Ganardi; Anthony W. Lin; Georg Zetzsche (Proc. ACM Program. Lang., 2024)

The Complexity of Separability for Semilinear Sets and Parikh Automata. - Elias Rojas Collins; Chris Köcher; Georg Zetzsche (MFCS, 2025)

NoPE: The Counting Power of Transformers with No Positional Encodings. - Chris Köcher; Alexander Kozachinskiy; Anthony Widjaja Lin; Marco Sälzer; Georg Zetzsche (CoRR, 2025)

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter. - Yousef Shakiba; Henry Sinclair-Banks; Georg Zetzsche (CoRR, 2025)