no code implementations • 21 Jan 2021 • Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
We take a language-theoretic perspective and show general decidability and undecidability results for asynchronous programs that capture all known results as well as show decidability of new and important classes.
Formal Languages and Automata Theory Programming Languages F.3.1
