default search action
Georg Zetzsche
Person information
- affiliation: Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j20]Pascal Bergsträßer
, Moses Ganardi
Ramsey Quantifiers in Linear Arithmetics. Proc. ACM Program. Lang. 8(POPL): 1-32 (2024) - [j19]A. R. Balasubramanian
Reachability in Continuous Pushdown VASS. Proc. ACM Program. Lang. 8(POPL): 90-114 (2024) - [c56]Pascal Baumann, Eren Keskin, Roland Meyer, Georg Zetzsche
Separability in Büchi VASS and Singly Non-Linear Systems of Inequalities. ICALP 2024: 126:1-126:19 - [c55]Christoph Haase, Shankara Narayanan Krishna, Khushraj Madnani, Om Swostik Mishra, Georg Zetzsche
An Efficient Quantifier Elimination Procedure for Presburger Arithmetic. ICALP 2024: 142:1-142:17 - [c54]Ashwani Anand
Verifying Unboundedness via Amalgamation. LICS 2024: 4:1-4:15 - [c53]Laura Ciobanu
Slice closures of indexed languages and word equations with counting constraints. LICS 2024: 25:1-25:12 - [c52]Moses Ganardi, Irmak Saglam, Georg Zetzsche
Directed Regular and Context-Free Languages. STACS 2024: 36:1-36:20 - [i50]Moses Ganardi, Irmak Saglam, Georg Zetzsche:
Directed Regular and Context-Free Languages. CoRR abs/2401.07106 (2024) - [i49]Christoph Haase, Shankara Narayanan Krishna, Khushraj Madnani, Om Swostik Mishra, Georg Zetzsche:
An efficient quantifier elimination procedure for Presburger arithmetic. CoRR abs/2405.01183 (2024) - [i48]Laura Ciobanu, Georg Zetzsche:
Slice closures of indexed languages and word equations with counting constraints. CoRR abs/2405.07911 (2024) - [i47]Ashwani Anand, Sylvain Schmitz, Lia Schütze, Georg Zetzsche:
Verifying Unboundedness via Amalgamation. CoRR abs/2405.10296 (2024) - [i46]Pascal Bergsträßer, Chris Köcher, Anthony Widjaja Lin, Georg Zetzsche:
The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective. CoRR abs/2405.16166 (2024) - [i45]Pascal Baumann, Eren Keskin, Roland Meyer, Georg Zetzsche:
Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities. CoRR abs/2406.01008 (2024) - [i44]Elias Rojas Collins, Chris Köcher, Georg Zetzsche:
The complexity of separability for semilinear sets and Parikh automata. CoRR abs/2410.00548 (2024) - 2023
- [j18]Moses Ganardi, Markus Lohrey, Georg Zetzsche:
Knapsack and the power word problem in solvable Baumslag-Solitar groups. Int. J. Algebra Comput. 33(3): 617-639 (2023) - [j17]Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche:
Existential Definability over the Subword Ordering. Log. Methods Comput. Sci. 19(4) (2023) - [j16]Pascal Baumann
Context-Bounded Verification of Context-Free Specifications. Proc. ACM Program. Lang. 7(POPL): 2141-2170 (2023) - [c51]Pascal Baumann
Monus Semantics in Vector Addition Systems with States. CONCUR 2023: 10:1-10:18 - [c50]Ashwani Anand, Georg Zetzsche:
Priority Downward Closures. CONCUR 2023: 39:1-39:18 - [c49]Pascal Baumann
Unboundedness Problems for Machines with Reversal-Bounded Counters. FoSSaCS 2023: 240-264 - [c48]Chris Köcher
Regular Separators for VASS Coverability Languages. FSTTCS 2023: 15:1-15:19 - [c47]Alain Finkel, Shankara Narayanan Krishna, Khushraj Madnani, Rupak Majumdar, Georg Zetzsche:
Counter Machines with Infrequent Reversals. FSTTCS 2023: 42:1-42:17 - [c46]Pascal Baumann
Context-Bounded Analysis of Concurrent Programs (Invited Talk). ICALP 2023: 3:1-3:16 - [c45]Pascal Baumann
Checking Refinement of Asynchronous Programs Against Context-Free Specifications. ICALP 2023: 110:1-110:20 - [c44]Pascal Baumann
Regular Separability in Büchi VASS. STACS 2023: 9:1-9:19 - [i43]Pascal Baumann
Unboundedness problems for machines with reversal-bounded counters. CoRR abs/2301.10198 (2023) - [i42]Pascal Baumann
Regular Separability in Büchi VASS. CoRR abs/2301.11242 (2023) - [i41]Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Checking Refinement of Asynchronous Programs against Context-Free Specifications. CoRR abs/2306.13058 (2023) - [i40]Ashwani Anand, Georg Zetzsche:
Priority Downward Closures. CoRR abs/2307.07460 (2023) - [i39]Pascal Baumann
Monus semantics in vector addition systems with states. CoRR abs/2308.14926 (2023) - [i38]A. R. Balasubramanian, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Reachability in Continuous Pushdown VASS. CoRR abs/2310.16798 (2023) - [i37]Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche:
Ramsey Quantifiers in Linear Arithmetics. CoRR abs/2311.04031 (2023) - 2022
- [j15]Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond. Log. Methods Comput. Sci. 18(4) (2022) - [j14]Pascal Baumann
Context-bounded verification of thread pools. Proc. ACM Program. Lang. 6(POPL): 1-28 (2022) - [c43]Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis
Reachability in Bidirected Pushdown VASS. ICALP 2022: 124:1-124:20 - [c42]Moses Ganardi, Rupak Majumdar, Georg Zetzsche:
The Complexity of Bidirected Reachability in Valence Systems. LICS 2022: 26:1-26:15 - [c41]Pascal Bergsträßer
Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification. LICS 2022: 28:1-28:14 - [c40]Markus Lohrey
Membership Problems in Finite Groups. MFCS 2022: 71:1-71:16 - [c39]Pascal Baumann
Existential Definability over the Subword Ordering. STACS 2022: 7:1-7:15 - [e1]Anthony W. Lin, Georg Zetzsche, Igor Potapov:
Reachability Problems - 16th International Conference, RP 2022, Kaiserslautern, Germany, October 17-21, 2022, Proceedings. Lecture Notes in Computer Science 13608, Springer 2022, ISBN 978-3-031-19134-3 [contents] - [i36]Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schütze, Georg Zetzsche:
Reachability in Bidirected Pushdown VASS. CoRR abs/2204.11799 (2022) - [i35]Pascal Bergsträßer
Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification. CoRR abs/2205.09015 (2022) - [i34]Markus Lohrey, Andreas Rosowski, Georg Zetzsche:
Membership Problems in Finite Groups. CoRR abs/2206.11756 (2022) - [i33]Pascal Baumann
Existential Definability over the Subword Ordering. CoRR abs/2210.15642 (2022) - 2021
- [j13]Georg Zetzsche:
The emptiness problem for valence automata over graph monoids. Inf. Comput. 277: 104583 (2021) - [j12]Pascal Baumann
Context-bounded verification of liveness properties for multithreaded shared-memory programs. Proc. ACM Program. Lang. 5(POPL): 1-31 (2021) - [c38]Aneesh K. Shetty, S. Krishna, Georg Zetzsche:
Scope-Bounded Reachability in Valence Systems. CONCUR 2021: 29:1-29:19 - [c37]Georg Zetzsche
Recent Advances on Reachability Problems for Valence Systems (Invited Talk). RP 2021: 52-65 - [c36]Pascal Bergsträßer
A Characterization of Wreath Products Where Knapsack Is Decidable. STACS 2021: 11:1-11:17 - [c35]Rupak Majumdar
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond. TACAS (1) 2021: 449-467 - [i32]Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond. CoRR abs/2101.08611 (2021) - [i31]Aneesh K. Shetty, S. Krishna, Georg Zetzsche:
Scope-Bounded Reachability in Valence Systems. CoRR abs/2108.00963 (2021) - [i30]Moses Ganardi, Rupak Majumdar, Georg Zetzsche:
The complexity of bidirected reachability in valence systems. CoRR abs/2110.03654 (2021) - [i29]Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Context-Bounded Verification of Thread Pools. CoRR abs/2111.09022 (2021) - 2020
- [c34]Pascal Baumann
The Complexity of Bounded Context Switching with Dynamic Thread Creation. ICALP 2020: 111:1-111:16 - [c33]Michaël Cadilhac
Rational Subsets of Baumslag-Solitar Groups. ICALP 2020: 116:1-116:16 - [c32]Michael Figelius
The Complexity of Knapsack Problems in Wreath Products. ICALP 2020: 126:1-126:18 - [c31]Mikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski
Extensions of ω-Regular Languages. LICS 2020: 266-272 - [c30]Wojciech Czerwinski, Georg Zetzsche:
An Approach to Regular Separability in Vector Addition Systems. LICS 2020: 341-354 - [c29]Markus Lohrey
Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups. MFCS 2020: 67:1-67:15 - [i28]Michael Figelius
The complexity of knapsack problems in wreath products. CoRR abs/2002.08086 (2020) - [i27]Mikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski, Georg Zetzsche:
Extensions of ω-Regular Languages. CoRR abs/2002.09393 (2020) - [i26]Michaël Cadilhac, Dmitry Chistikov, Georg Zetzsche:
Rational subsets of Baumslag-Solitar groups. CoRR abs/2006.11898 (2020) - [i25]Wojciech Czerwinski, Georg Zetzsche:
An Approach to Regular Separability in Vector Addition Systems. CoRR abs/2007.00111 (2020) - [i24]Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
Context-Bounded Verification of Liveness Properties for Multithreaded Shared-Memory Programs. CoRR abs/2011.04581 (2020) - [i23]Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche:
The complexity of bounded context switching with dynamic thread creation. CoRR abs/2011.05825 (2020)
2010 – 2019
- 2019
- [c28]Dietrich Kuske, Georg Zetzsche:
Languages Ordered by the Subword Order. FoSSaCS 2019: 348-364 - [c27]Ramanathan S. Thinniyam
Regular Separability and Intersection Emptiness Are Independent Problems. FSTTCS 2019: 51:1-51:15 - [c26]Christoph Haase
Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests. LICS 2019: 1-14 - [c25]Sylvain Schmitz
Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets. RP 2019: 193-201 - [i22]Dietrich Kuske, Georg Zetzsche:
Languages ordered by the subword order. CoRR abs/1901.02194 (2019) - [i21]Sylvain Schmitz, Georg Zetzsche:
Coverability is Undecidable in One-dimensional Pushdown Vector Addition Systems with Resets. CoRR abs/1906.07069 (2019) - [i20]Ramanathan S. Thinniyam, Georg Zetzsche:
Regular Separability and Intersection Emptiness are Independent Problems. CoRR abs/1908.04038 (2019) - 2018
- [j11]Markus Lohrey
Knapsack in Graph Groups. Theory Comput. Syst. 62(1): 192-246 (2018) - [c24]Roland Meyer, Sebastian Muskalla
Bounded Context Switching for Valence Systems. CONCUR 2018: 12:1-12:18 - [c23]Wojciech Czerwinski, Piotr Hofman
Unboundedness Problems for Languages of Vector Addition Systems. ICALP 2018: 119:1-119:15 - [c22]Georg Zetzsche
Separability by piecewise testable languages and downward closures beyond subwords. LICS 2018: 929-938 - [c21]Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche
Knapsack Problems for Wreath Products. STACS 2018: 32:1-32:13 - [i19]Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche:
Unboundedness problems for languages of vector addition systems. CoRR abs/1802.06683 (2018) - [i18]Georg Zetzsche:
PTL-separability and closures for WQOs on words. CoRR abs/1802.07397 (2018) - [i17]Roland Meyer, Sebastian Muskalla, Georg Zetzsche:
Bounded Context Switching for Valence Systems. CoRR abs/1803.09703 (2018) - 2017
- [j10]Wojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun, Georg Zetzsche
A Characterization for Decidable Separability by Piecewise Testable Languages. Discret. Math. Theor. Comput. Sci. 19(4) (2017) - [j9]Georg Zetzsche
On Boolean Closed Full Trios and Rational Kripke Frames. Theory Comput. Syst. 60(3): 438-472 (2017) - [c20]Simon Halfon, Philippe Schnoebelen, Georg Zetzsche
Decidability, complexity, and expressiveness of first-order logic over the subword ordering. LICS 2017: 1-12 - [c19]Markus Lohrey, Georg Zetzsche
The Complexity of Knapsack in Graph Groups. STACS 2017: 52:1-52:14 - [i16]Simon Halfon, Philippe Schnoebelen, Georg Zetzsche:
Decidability, Complexity, and Expressiveness of First-Order Logic Over the Subword Ordering. CoRR abs/1701.07470 (2017) - [i15]Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche:
Knapsack Problems for Wreath Products. CoRR abs/1709.09598 (2017) - [i14]Georg Zetzsche:
The Emptiness Problem for Valence Automata over Graph Monoids. CoRR abs/1710.07528 (2017) - 2016
- [b1]Georg Zetzsche:
Monoids as Storage Mechanisms. Kaiserslautern University of Technology, Germany, 2016 - [j8]Tara Brough
Permutations of context-free, ET0L and indexed languages. Discret. Math. Theor. Comput. Sci. 17(3): 167-178 (2016) - [j7]Georg Zetzsche:
Monoids as Storage Mechanisms. Bull. EATCS 120 (2016) - [c18]Daniel König, Markus Lohrey, Georg Zetzsche:
Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. AMS-EMS-SPM Joint Meeting 2016 - [c17]Georg Zetzsche
The Complexity of Downward Closure Comparisons. ICALP 2016: 123:1-123:14 - [c16]Mohamed Faouzi Atig, Dmitry Chistikov
The complexity of regular abstractions of one-counter languages. LICS 2016: 207-216 - [c15]Emanuele D'Osualdo
First-order logic with reachability for infinite-state systems. LICS 2016: 457-466 - [c14]Markus Lohrey, Georg Zetzsche
Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products. STACS 2016: 50:1-50:14 - [i13]Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche:
Complexity of regular abstractions of one-counter languages. CoRR abs/1602.03419 (2016) - [i12]Tara Brough, Laura Ciobanu, Murray Elder, Georg Zetzsche:
Permutations of context-free, ET0L and indexed languages. CoRR abs/1604.05431 (2016) - [i11]Georg Zetzsche:
The complexity of downward closure comparisons. CoRR abs/1605.03149 (2016) - [i10]Markus Lohrey, Georg Zetzsche:
The Complexity of Knapsack in Graph Groups. CoRR abs/1610.00373 (2016) - 2015
- [j6]Markus Lohrey, Benjamin Steinberg
Rational subsets and submonoids of wreath products. Inf. Comput. 243: 191-204 (2015) - [c13]Georg Zetzsche
An Approach to Computing Downward Closures. ICALP (2) 2015: 440-451 - [c12]Georg Zetzsche
The Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets. RP 2015: 166-178 - [c11]Georg Zetzsche
Computing Downward Closures for Stacked Counter Automata. STACS 2015: 743-756 - [i9]Georg Zetzsche:
An approach to computing downward closures. CoRR abs/1503.01068 (2015) - [i8]Daniel König, Markus Lohrey, Georg Zetzsche:
Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. CoRR abs/1507.05145 (2015) - [i7]Markus Lohrey, Georg Zetzsche:
Knapsack in graph groups, HNN-extensions and amalgamated products. CoRR abs/1509.05957 (2015) - 2014
- [c10]Martin Huschenbett, Dietrich Kuske, Georg Zetzsche
The Monoid of Queue Actions. MFCS (1) 2014: 340-351 - [c9]Markus Lohrey, Georg Zetzsche
On Boolean closed full trios and rational Kripke frames. STACS 2014: 530-541 - [i6]Martin Huschenbett, Dietrich Kuske, Georg Zetzsche:
The monoid of queue actions. CoRR abs/1404.5479 (2014) - [i5]Georg Zetzsche:
Computing downward closures for stacked counter automata. CoRR abs/1409.7922 (2014) - 2013
- [c8]Markus Lohrey, Benjamin Steinberg
Rational Subsets and Submonoids of Wreath Products. ICALP (2) 2013: 361-372 - [c7]Georg Zetzsche
Silent Transitions in Automata with Storage. ICALP (2) 2013: 434-445 - [c6]P. Buckheister, Georg Zetzsche
Semilinearity and Context-Freeness of Languages Accepted by Valence Automata. MFCS 2013: 231-242 - [i4]Markus Lohrey, Benjamin Steinberg, Georg Zetzsche:
Rational Subsets and Submonoids of Wreath Products. CoRR abs/1302.2455 (2013) - [i3]Georg Zetzsche:
Silent Transitions in Automata with Storage. CoRR abs/1302.3798 (2013) - [i2]P. Buckheister, Georg Zetzsche:
Semilinearity and Context-Freeness of Languages Accepted by Valence Automata. CoRR abs/1306.3260 (2013) - 2011
- [j5]Georg Zetzsche
Toward Understanding the Generative Capacity of Erasing Rules in Matrix Grammars. Int. J. Found. Comput. Sci. 22(2): 411-426 (2011) - [c5]Georg Zetzsche
A Sufficient Condition for Erasing Productions to Be Avoidable. Developments in Language Theory 2011: 452-463 - [c4]Georg Zetzsche
On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids. ICALP (2) 2011: 222-233 - [i1]Georg Zetzsche:
On the capabilities of grammars, automata, and transducers controlled by monoids. CoRR abs/1103.3361 (2011) - 2010
- [c3]Georg Zetzsche
On Erasing Productions in Random Context Grammars. ICALP (2) 2010: 175-186
2000 – 2009
- 2009
- [j4]Manfred Kudlek, Patrick Totzke
Multiset Pushdown Automata. Fundam. Informaticae 93(1-3): 221-233 (2009) - [j3]Manfred Kudlek, Patrick Totzke
Properties of Multiset Language Classes Defined by Multiset Pushdown Automata. Fundam. Informaticae 93(1-3): 235-244 (2009) - [c2]Georg Zetzsche
Erasing in Petri Net Languages and Matrix Grammars. Developments in Language Theory 2009: 490-501 - 2008
- [j2]Berndt Farwer, Matthias Jantzen, Manfred Kudlek, Heiko Rölke, Georg Zetzsche:
Petri Net Controlled Finite Automata. Fundam. Informaticae 85(1-4): 111-121 (2008) - [j1]Matthias Jantzen, Manfred Kudlek, Georg Zetzsche:
Language Classes Defined by Concurrent Finite Automata. Fundam. Informaticae 85(1-4): 267-280 (2008) - [c1]Matthias Jantzen, Georg Zetzsche
Labeled Step Sequences in Petri Nets. Petri Nets 2008: 270-287
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 20:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: