GPUs are progressively being integrated into modern society, playing a pivotal role in
Artificial Intelligence and High-Performance Computing. Programmers need a deep …

The operator precedence languages (OPLs) represent the largest known subclass of the
context-free languages which enjoys all desirable closure and decidability properties. This …

We define novel algorithms for the inclusion problem between two visibly pushdown
languages of infinite words, an EXPTime-complete problem. Our algorithms search for …

We introduce an algorithmic framework to decide whether inclusion holds between
languages of infinite words over a finite alphabet. Our approach falls within the class of …

We present a uniform approach for solving language inclusion problems. Our approach
relies on a least fixpoint characterization and a quasiorder to compare words of the “smaller” …

This open access book constitutes the proceedings of the 29th International Conference on
Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2023, which was …

We introduce an algorithmic framework to decide the language inclusion for languages of
infinite words. We define algorithms for different decidable cases like the inclusion between …