Jump to Content

The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages

Narad Rampersad
Jeffrey Shallit
Fundamenta Informaticae, vol. 116 (2012), pp. 223-236

Abstract

Research Areas