( en | de | ru )

 

Disambiguation of "Zetzsche, Georg"

Author of the publication

copydeleteadd this publication to your clipboard
Permutations of context-free, ET0L and indexed languages.

, , , and . Discret. Math. Theor. Comput. Sci., 17 (3): 167-178 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Günther Zetzsche

Sybille Zetzsche

Günther Zetzsche

Günther Zetzsche

Claus Zetzsche

 

Other publications of authors with the same name

Context-Bounded Verification of Context-Free Specifications., , , , and . Proc. ACM Program. Lang., 7 (POPL): 2141-2170 (January 2023)PTL-separability and closures for WQOs on words.. CoRR, (2018)Separability by piecewise testable languages and downward closures beyond subwords.. LICS, page 929-938. ACM, (2018)The complexity of bidirected reachability in valence systems., , and . CoRR, (2021)The Complexity of Downward Closure Comparisons.. ICALP, volume 55 of LIPIcs, page 123:1-123:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Rational Subsets of Baumslag-Solitar Groups., , and . ICALP, volume 168 of LIPIcs, page 116:1-116:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Complexity of Bidirected Reachability in Valence Systems., , and . LICS, page 26:1-26:15. ACM, (2022)General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond., , and . TACAS (1), volume 12651 of Lecture Notes in Computer Science, page 449-467. Springer, (2021)Regular Separability and Intersection Emptiness Are Independent Problems., and . FSTTCS, volume 150 of LIPIcs, page 51:1-51:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Language Classes Defined by Concurrent Finite Automata., , and . Fundam. Informaticae, 85 (1-4): 267-280 (2008)