MOORE REDUCIBILITY FOR REGULAR LANGUAGES
2009 年 70 巻 1 号 p. 95-107
詳細
2009 年 70 巻 1 号 p. 95-107
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.
