: Over the last 30 years or so many results have appeared on the descriptional complexity of machines with limited resources. Since these results have appeared in a variety of diff...
Jonathan Goldstine, Martin Kappes, Chandra M. R. K...
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
Rohit Chadha, Axel Legay, Pavithra Prabhakar, Mahe...
Operator precedence languages, designated as Floyd’s Languages (FL) to honor their inventor, are a classical deterministic context-free family. FLs are known to be a boolean fami...
d Abstract) Zhe Dang ¡£¢¤¢ , Oscar H. Ibarra ¥ , Pierluigi San Pietro ¦ , and Gaoyan Xie ¡ § School of Electrical Engineering and Computer Science Washington State Univers...
Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, G...