Spremljaj
Georg Zetzsche
Georg Zetzsche
MPI-SWS, Germany
Preverjeni e-poštni naslov na mpi-sws.org - Domača stran
Naslov
Navedeno
Navedeno
Leto
An approach to computing downward closures
G Zetzsche
Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015
592015
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
582016
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
562017
The complexity of downward closure comparisons
G Zetzsche
arXiv preprint arXiv:1605.03149, 2016
312016
Rational subsets and submonoids of wreath products
M Lohrey, B Steinberg, G Zetzsche
Information and Computation 243, 191-204, 2015
292015
Knapsack in graph groups
M Lohrey, G Zetzsche
Theory of Computing Systems 62 (1), 192-246, 2018
272018
Computing downward closures for stacked counter automata
G Zetzsche
arXiv preprint arXiv:1409.7922, 2014
262014
On erasing productions in random context grammars
G Zetzsche
Automata, Languages and Programming: 37th International Colloquium, ICALP …, 2010
262010
Properties of multiset language classes defined by multiset pushdown automata
M Kudlek, P Totzke, G Zetzsche
Fundamenta Informaticae 93 (1-3), 235-244, 2009
252009
Languages ordered by the subword order
D Kuske, G Zetzsche
arXiv preprint arXiv:1901.02194, 2019
242019
Multiset pushdown automata
M Kudlek, P Totzke, G Zetzsche
Fundamenta Informaticae 93 (1-3), 221-233, 2009
242009
A Characterization for Decidable Separability by Piecewise Testable Languages
G Zetzsche, M Zeitoun, L van Rooijen, W Martens, W Czerwiński
Discrete Mathematics & Theoretical Computer Science 19, 2017
23*2017
Silent transitions in automata with storage
G Zetzsche
International Colloquium on Automata, Languages, and Programming, 434-445, 2013
222013
The emptiness problem for valence automata over graph monoids
G Zetzsche
Information and Computation 277, 104583, 2021
20*2021
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
20*2011
Separability by piecewise testable languages and downward closures beyond subwords
G Zetzsche
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018
19*2018
Knapsack problems for wreath products
M Ganardi, D König, M Lohrey, G Zetzsche
arXiv preprint arXiv:1709.09598, 2017
192017
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
192013
Rational subsets of Baumslag-Solitar groups
M Cadilhac, D Chistikov, G Zetzsche
arXiv preprint arXiv:2006.11898, 2020
182020
Monoids as storage mechanisms
G Zetzsche
Technische Universität Kaiserslautern, 2016
182016
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20