- Bounded Treewidth, Multiple Context-Free Grammars, and Downward Closures C. Aiswarya Pascal Baumann Prakash Saivasan Lia Schutze Georg Zetzsche Fri 09 January 2026
- Cost Automata, Safe Schemes, and Downward Closures David Barozzini Lorenzo Clemente Thomas Colcombet Paweł Parys Tue 18 April 2023
- Separability by Piecewise Testable Languages and Downward Closures Beyond Subwords Georg Zetzsche Sat 14 July 2018
- The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages Narad Rampersad Jeffrey Shallit Zhi Xu Mon 29 February 2016
- On the State Complexity of Scattered Substrings and Superstrings Alexander Okhotin Mon 29 February 2016
- Complexity of regular abstractions of one-counter languages Mohamed Faouzi Atig Dmitry Chistikov Piotr Hofman K Narayan Kumar Prakash Saivasan Georg Zetzsche Mon 29 February 2016
- On the State Complexity of Closures and Interiors of Regular Languages with Subwords and Superwords P. Karandikar M. Niewerth Ph. Schnoebelen Tue 12 January 2016
Library Size: 13G (7 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
