Some Reducibilities on Regular Sets

摘要

We discuss some known and introduce some new reducibili-ties on regular sets. We establish some facts on the corresponding degree structures and relate some reducibilities to natural hierarchies of regular sets. As an application, we characterize regular languages whose leaf-language classes (in the balanced model) are contained in the polynomial hierarchy. For any reducibility we try to give some motivation and interesting open questions, in a hope to convince the reader that study of these reducibilities is important for automata theory and computational complexity.