1
0
0
(1 - 24 von 26
)
Documents authored by Göller, Stefan - DROPSdagstuhl.de
drops.dagstuhl.de
von S Göller · Zitiert von: 9 — Stefan Göller and Nathan Grosshans. Published in: LIPIcs, Volume 289, 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024) ...
arXivhttps://arxiv.org › csThe \mathsf{AC}^0-Complexity Of Visibly Pushdown Languages
arxiv.org
von S Göller · — The \mathsf{AC}^0-Complexity Of Visibly Pushdown Languages. Authors:Stefan Göller, Nathan Grosshans.
The AC⁰-Complexity of Visibly Pushdown Languages - DROPSdagstuhl.de
drops.dagstuhl.de
von S Göller · — Stefan Göller and Nathan Grosshans. The AC⁰-Complexity of Visibly Pushdown Languages. In 41st International Symposium on Theoretical Aspects ...
kath-in-sued-ost.de
www.kath-in-sued-ost.de
Pfarrer Stefan Göller aus der Nachbarpfarrei stirbt völlig überraschend Eröffnung der neuen Büchereiräume Prälat Wilhelm Reitzer, der erste ...
Wednesday March 13th, 2024STACS 2024
stacs2024.limos.fr
— Stefan Goeller: “The AC0-Complexity Of Visibly Pushdown Languages”. 09:10-09:35. Ankita Sarkar: “Fault-tolerant k-Supplier with Outliers ...
[ ] Branching-time model checking of one-counter processes
arxiv.org
von S Göller · · Zitiert von: 18 — From: Stefan Göller [view email] [v1] Mon, 21 Dec :45:23 UTC (99 KB) [v2] Wed, 3 Feb :38:53 UTC (99 KB). Full-text links: ... › cs
Documents authored by Göller, Stefan - DROPS - Schloss Dagstuhldrops.dagstuhl.de › search › documents
drops.dagstuhl.de
Stefan Göller and Mathieu Hilaire. Published in: LIPIcs, Volume 187, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) ...
[ ] Bisimulation Finiteness of Pushdown Systems Is Elementary
arxiv.org
Authors:Stefan Göller, Paweł Parys · Download PDF. Abstract: We show that in case a pushdown system is bisimulation equivalent to a finite ...
Dirk Nowotka: A Note on an Extension of PDL - Abstract
www2.informatik.uni-stuttgart.de
Dirk Nowotka and Stefan Göller A Note on an Extension of PDL. Journal of Applied Logic, 6(4): , Abstract
[ ] Reachability in Two-Dimensional Vector Addition Systems...
arxiv.org
Authors: Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie. (Submitted on 13 Dec 2014). Abstract: Determining the complexity of the reachability problem for vector addition systems with states (VASS) is a long-standing open problem in computer science. Long known to be decidable, the ...
Missing: bern
On long words avoiding Zimin patternsarxiv.org › cs
arxiv.org
On long words avoiding Zimin patterns. Authors:Arnaud Carayol, Stefan Göller · Download PDF. Abstract: A pattern is encountered in a word if ...
[ ] On a Non-Context-Free Extension of PDL
arxiv.org
Authors:Stefan Göller, Dirk Nowotka. (Submitted on 4 Jul (v1), last revised 18 Jul (this version, v2)). Abstract: Over the last 25 years, a lot of work has ...
[PDF] On long words avoiding Zimin patterns - IGMigm.univ-mlv.fr › ~carayol › Papers
igm.univ-mlv.fr
Arnaud Carayol and Stefan Göller. On long words avoiding zimin patterns. In Heribert. Vollmer and Brigitte Vallée, editors, 34th Symposium on Theoretical ...
[ ] The First-Order Theory of Ground Tree Rewrite Graphs
arxiv.org
Authors:Stefan Göller (University of Bremen), Markus Lohrey (University of Leipzig). (Submitted on 5 Jul (v1), last revised 10 Feb (this version, v4)).
[PDF] The Reachability Problem for Two-Dimensional Vector HALhal.science › hal › document
hal.science
· Michael Blondin, Matthias Englert, Alain Finkel, Stefan Göller, Christoph Haase, et al.. The Reach- ability Problem for Two-Dimensional ...
Guerino Mazzola: Elemente der Musikinformatik: Ausgearbeitet von...
www.deepdyve.com
Read "Guerino Mazzola: Elemente der Musikinformatik: Ausgearbeitet von Roland Bärtschi unter Mitarbeit von Stefan Göller" on DeepDyve - Instant access to ...
[ ] The Complexity of Bisimulation and Simulation on Finite...
arxiv.org
Title:The Complexity of Bisimulation and Simulation on Finite Systems. Authors: Moses Ganardi, Stefan Göller, Markus Lohrey. (Submitted on 1 Jun (v1), ...
[ ] Reachability in two-parametric timed automata with one...
arxiv.org
· Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete. Authors:Stefan Göller, Mathieu Hilaire · Download PDF.
sortiert nach Relevanz / Datum