Before revision: In the present work, we study the hierarchy of p-sortable languages: regular languages accepted by automata of width p.
After revision: In the present work, we tackle the regular language indexing problem by first studying the hierarchy of p-sortable languages: regular languages accepted by automata of width p.