Zetzsche, Georg
- An Approach to Regular Separability in Vector Addition Systems
2020/01/01 by Wojciech Czerwiński, Czerwiński, Wojciech, Georg Zetzsche +1 · 3 citations
Biochemistry, Genetics and Molecular Biology · Computer Science · #Chemical Synthesis and Analysis #DNA and Biological Computing #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO) #semigroups and automata theory
- Reachability in Bidirected Pushdown VASS
2022/04/25 by Ganardi, Moses, Majumdar, Rupak, Pavlogiannis, Andreas +2 · 3 citations
#FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL)
- Rational Subsets and Submonoids of Wreath Products
2013/02/11 by Markus Lohrey, Lohrey, Markus, Benjamin Steinberg +3 · 1 citation
Computer Science · Mathematics · #20E22 #20F10 #68Q45 #Advanced Topology and Set Theory #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Geometric and Algebraic Topology #Group Theory (math.GR) #semigroups and automata theory
- Context-Bounded Verification of Thread Pools
2021/11/17 by Baumann, Pascal, Majumdar, Rupak, Thinniyam, Ramanathan S. +1 · 2 citations
#FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Programming Languages (cs.PL)
- Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups
2015/07/18 by König, Daniel, Lohrey, Markus, Zetzsche, Georg · 1 citation
#20F10 #68Q45 #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Group Theory (math.GR)
- Knapsack Problems for Wreath Products
2017/09/27 by Ganardi, Moses, König, Daniel, Lohrey, Markus +1 · 1 citation
#20F10 #F.4.3 #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Group Theory (math.GR)
- The Emptiness Problem for Valence Automata over Graph Monoids
2017/10/20 by Zetzsche, Georg · 1 citation
#FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Group Theory (math.GR) #Logic in Computer Science (cs.LO)
- Knapsack and the power word problem in solvable Baumslag-Solitar groups
2020/02/07 by Ganardi, Moses, Lohrey, Markus, Zetzsche, Georg · 1 citation
#20F10 #68Q06 #FOS: Mathematics #Group Theory (math.GR)
- Knapsack in graph groups, HNN-extensions and amalgamated products
2015/09/20 by Markus Lohrey, Lohrey, Markus, Georg Zetzsche +1 · 1 citation
Computer Science · #Algorithms and Data Compression #Computability, Logic, AI Algorithms #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Group Theory (math.GR) #semigroups and automata theory
- Permutations of context-free, ET0L and indexed languages
2016/04/19 by Brough, Tara, Ciobanu, Laura, Elder, Murray +1 · 1 citation
#20F65 #68Q45 #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL)
- The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective
2024/05/25 by Pascal Bergsträßer, Bergsträßer, Pascal, Chris Köcher +5 · 2 citations
Computer Science · #Algorithms and Data Compression #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Neural Networks and Applications #Topic Modeling
- Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification
2022/05/18 by Pascal Bergsträßer, Bergsträßer, Pascal, Moses Ganardi +5 · 2 citations
Computer Science · #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #semigroups and automata theory
- Unboundedness problems for languages of vector addition systems
2018/02/19 by Wojciech Czerwiński, Czerwiński, Wojciech, Piotr Hofman +3 · 1 citation
Computer Science · #Advanced Algebra and Logic #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic, programming, and type systems #semigroups and automata theory
- An efficient quantifier elimination procedure for Presburger arithmetic
2024/05/02 by Christoph Haase, Shankara Narayanan Krishna, Haase, Christoph +7 · 2 citations
Computer Science · #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Logic (math.LO) #Logic in Computer Science (cs.LO) #Numerical Methods and Algorithms
- Ramsey Quantifiers in Linear Arithmetics
2023/11/07 by Pascal Bergsträßer, Bergsträßer, Pascal, Moses Ganardi +5 · 2 citations
Computer Science · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems
- Membership Problems in Finite Groups
2022/06/23 by Lohrey, Markus, Rosowski, Andreas, Zetzsche, Georg · 1 citation
#20B05 #20F10 #68Q45 #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Group Theory (math.GR)
- Directed Regular and Context-Free Languages
2024/01/13 by Moses Ganardi, Ganardi, Moses, Irmak Sağlam +3 · 1 citation
Computer Science · #Advanced Algebra and Logic #Computation and Language (cs.CL) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification #semigroups and automata theory
- A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
2025/05/19 by Yousef Shakiba, Shakiba, Yousef, Henry Sinclair-Banks +3 · 1 citation
Computer Science · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO) #Machine Learning and Algorithms #Quantum Computing Algorithms and Architecture #Quantum-Dot Cellular Automata