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
392015
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
352016
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
272017
On erasing productions in random context grammars
G Zetzsche
International Colloquium on Automata, Languages, and Programming, 175-186, 2010
242010
Computing downward closures for stacked counter automata
G Zetzsche
arXiv preprint arXiv:1409.7922, 2014
182014
Multiset pushdown automata
M Kudlek, P Totzke, G Zetzsche
Fundamenta Informaticae 93 (1-3), 221-233, 2009
172009
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
Knapsack in graph groups
M Lohrey, G Zetzsche
Theory of Computing Systems 62 (1), 192-246, 2018
142018
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
Silent transitions in automata with storage
G Zetzsche
International Colloquium on Automata, Languages, and Programming, 434-445, 2013
142013
Erasing in petri net languages and matrix grammars
G Zetzsche
International Conference on Developments in Language Theory, 490-501, 2009
142009
Knapsack in graph groups, HNN-extensions and amalgamated products
M Lohrey, G Zetzsche
arXiv preprint arXiv:1509.05957, 2015
132015
Properties of multiset language classes defined by multiset pushdown automata
M Kudlek, P Totzke, G Zetzsche
Fundamenta Informaticae 93 (1-3), 235-244, 2009
132009
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
122014
The complexity of downward closure comparisons
G Zetzsche
arXiv preprint arXiv:1605.03149, 2016
112016
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 monoid of queue actions
M Huschenbett, D Kuske, G Zetzsche
Semigroup forum 95 (3), 475-508, 2017
102017
Labeled step sequences in Petri nets
M Jantzen, G Zetzsche
International Conference on Applications and Theory of Petri Nets, 270-287, 2008
102008
The complexity of regular abstractions of one-counter languages
MF Atig, D Chistikov, P Hofman, KN Kumar, P Saivasan, G Zetzsche
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-10, 2016
92016
Language classes defined by concurrent finite automata
M Jantzen, M Kudlek, G Zetzsche
Fundamenta Informaticae 85 (1-4), 267-280, 2008
92008
The system can't perform the operation now. Try again later.
Articles 1–20