MOORE REDUCIBILITY FOR REGULAR LANGUAGES

Abstract

We investigate a simple notion of reduction for Reg11lar sets. We call this Moore reduction because the transformations use Moore machines. We show that under this reduction the Regular sets form a bi-hierarchy with complete sets.