Georg Zetzsche
Title
Cited by
Cited by
Year
An approach to computing downward closures
G Zetzsche
International Colloquium on Automata, Languages, and Programming, 440-451, 2015
472015
Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups
D König, M Lohrey, G Zetzsche
Algebra and Computer Science 677, 138-153, 2016
382016
Decidability, complexity, and expressiveness of first-order logic over the subword ordering
S Halfon, P Schnoebelen, G Zetzsche
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017
312017
On erasing productions in random context grammars
G Zetzsche
International Colloquium on Automata, Languages, and Programming, 175-186, 2010
242010
Knapsack in graph groups, HNN-extensions and amalgamated products
M Lohrey, G Zetzsche
arXiv preprint arXiv:1509.05957, 2015
192015
Computing downward closures for stacked counter automata
G Zetzsche
arXiv preprint arXiv:1409.7922, 2014
192014
Toward understanding the generative capacity of erasing rules in matrix grammars
G Zetzsche
International Journal of Foundations of Computer Science 22 (02), 411-426, 2011
19*2011
Multiset pushdown automata
M Kudlek, P Totzke, G Zetzsche
Fundamenta Informaticae 93 (1-3), 221-233, 2009
182009
Rational subsets and submonoids of wreath products
M Lohrey, B Steinberg, G Zetzsche
Information and Computation 243, 191-204, 2015
172015
Silent transitions in automata with storage
G Zetzsche
International Colloquium on Automata, Languages, and Programming, 434-445, 2013
172013
Knapsack in graph groups
M Lohrey, G Zetzsche
Theory of Computing Systems 62 (1), 192-246, 2018
162018
Properties of multiset language classes defined by multiset pushdown automata
M Kudlek, P Totzke, G Zetzsche
Fundamenta Informaticae 93 (1-3), 235-244, 2009
162009
Petri net controlled finite automata
B Farwer, M Jantzen, M Kudlek, H Rölke, G Zetzsche
Fundamenta informaticae 85 (1-4), 111-121, 2008
162008
The complexity of downward closure comparisons
G Zetzsche
arXiv preprint arXiv:1605.03149, 2016
142016
Semilinearity and context-freeness of languages accepted by valence automata
P Buckheister, G Zetzsche
International Symposium on Mathematical Foundations of Computer Science, 231-242, 2013
142013
The emptiness problem for valence automata over graph monoids
G Zetzsche
Information and Computation 277, 104583, 2021
12*2021
Knapsack problems for wreath products
M Ganardi, D König, M Lohrey, G Zetzsche
arXiv preprint arXiv:1709.09598, 2017
122017
The monoid of queue actions
M Huschenbett, D Kuske, G Zetzsche
Semigroup forum 95 (3), 475-508, 2017
112017
A characterization for decidable separability by piecewise testable languages
W Czerwiński, W Martens, L van Rooijen, M Zeitoun, G Zetzsche
arXiv preprint arXiv:1410.1042, 2014
112014
On the capabilities of grammars, automata, and transducers controlled by monoids
G Zetzsche
International Colloquium on Automata, Languages, and Programming, 222-233, 2011
112011
The system can't perform the operation now. Try again later.
Articles 1–20